The Complexity of Splitting Necklaces and Bisecting Ham Sandwiches
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.
The k-distance transformation (k-DT) computes the k nearest patterns from each location on a discrete regular grid within a D dimensional volume, which Warfield [Patt. Rec. Letters, 17(1996) 713-721] proposed to implement using 2^D raster scans. We investi ...
In the secure communication problem, we focus on safe termination. In applications such as electronic transactions, we want each party to be ensured that both sides agree on the same state: success or failure. This problem is equivalent to the well known c ...
Magnetic resonance spectroscopy imaging (MRSI) is a promising and developing tool in medical imaging. Because of various difficulties imposed by the imperfections of the scanner and the reconstruction algorithms, its applicability in clinical practice is r ...
From an error rate performance perspective, maximum likelihood (ML) detection is the preferred detection method for multiple-input multiple-output (MIMO) communication systems. However, for high transmission rates a straight forward exhaustive search imple ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2006
We present a new method based on B-spline snakes (active contours) for measuring high-accuracy contact angles. In this approach, we avoid making physical assumptions by defining the contour of the drop as a versatile B-spline curve. When useful, we extend ...
In handsfree tele- or video-communication, acoustic echoes arise due to the coupling between the loudspeakers and microphones. It is much more challenging to remove the undesired acoustic echoes for stereo or multi-channel tele-communication systems than f ...
Real world applications such as hands-free speech recognition of isolated digits may have to deal with potentially very noisy environments. Existing state-of-the-art solutions to this problem use feature-based HMMs, with a preprocessing stage to clean the ...
This paper introduces a new enumeration technique for (multi)parametric linear programs (pLPs) based on the reverse-search paradigm. We prove that the proposed algorithm has a computational complexity that is linear in the size of the output (number of so- ...
Multiple-input multiple-output (MIMO) detection algorithms providing soft information for a subsequent channel decoder pose significant implementation challenges due to their high computational complexity. In this paper, we show how sphere decoding can be ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2006
The signed k-distance transformation (k-DT) computes the k nearest prototypes from each location on a discrete regular grid within a given D dimensional volume. We propose a new k-DT algorithm that divides the problem into D 1-dimensional problems and comp ...
