Delta Thales, a novel architecture for an orientating device with fixed RCM (remote center of movement) and linear movement in direction of the RCM
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Two of the major challenges in microphone array based adaptive beamforming, speech enhancement and distant speech recognition, are robust and accurate source localization and voice activity detection. This paper introduces a spatial gradient steered respon ...
Two of the major challenges in microphone array based adap- tive beamforming, speech enhancement and distant speech recognition, are robust and accurate source localization and voice activity detection. This paper introduces a spatial gra- dient steered re ...
An iterative procedure for the synthesis of uniform amplitude focused beam arrays is presented. Specifically, the goal is to optimize the locations of a fixed number of array elements with known excitations in order to synthesize narrow-beam low-sidelobe p ...
We prove a fixed point theorem for a family of Banach spaces, notably for L^1. Applications include the optimal answer to the "derivation problem" for group algebras which originated in the 1960s. ...
As long as a train does not conflict with others trains, the energy consumption for traction can be minimized according to its times of departure, arrival, and passing through fixed points. However, when a conflict of itineraries is foreseen, pacing trains ...
In [GT], Goldin and Tolman extend some ideas from Schubert calculus to the more general setting of Hamiltonian torus actions on compact symplectic manifolds with isolated fixed points. (See also [Kn99,Kn08].) The main goal of this paper is to build on this ...
Let C be a binary self-dual code with an automorphism g of order 2p, where p is an odd prime, such that gp is a fixed point free involution. If C is extremal of length a multiple of 24, all the involutions are fixed point free, except the Golay Code and ev ...
Institute of Electrical and Electronics Engineers2013
Consider a proper cocompact CAT(0) space X. We give a complete algebraic characterisation of amenable groups of isometries of X. For amenable discrete subgroups, an even narrower description is derived, implying Q-linearity in the torsion-free case. We est ...
Probabilistic construction of codes on two-dimensional arrays is proposed and analyzed. Instead of a pure combinatorial erasure model used in traditional array codes, we propose a mixed combinatorial-probabilistic model of limiting the number of column fai ...
IEEE Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011
This paper advocates a rigorously formal and compositional style for obtaining key performance and/or interface metrics of systems with real-time constraints. We propose a hierarchical approach that couples the independent and different by nature framework ...