Sciweavers

314 search results - page 60 / 63
» A Comparison of Known Codes, Random Codes, and the Best Code...
Sort
View
MOBICOM
2012
ACM
11 years 10 months ago
Faster GPS via the sparse fourier transform
GPS is one of the most widely used wireless systems. A GPS receiver has to lock on the satellite signals to calculate its position. The process of locking on the satellites is qui...
Haitham Hassanieh, Fadel Adib, Dina Katabi, Piotr ...
CVPR
2007
IEEE
14 years 9 months ago
Optimizing Binary MRFs via Extended Roof Duality
Many computer vision applications rely on the efficient optimization of challenging, so-called non-submodular, binary pairwise MRFs. A promising graph cut based approach for optim...
Carsten Rother, Vladimir Kolmogorov, Victor S. Lem...
ISBI
2004
IEEE
14 years 8 months ago
SCIRun/BioPSE: Integrated Problem Solving Environment for Bioelectric Field Problems and Visualization
SCIRun is a general purpose problem solving environment that seeks to integrate the steps of preparing, executing, and visualizing simulations of physical and biological systems. ...
Robert S. MacLeod, David M. Weinstein, J. Davison ...
BMCBI
2005
122views more  BMCBI 2005»
13 years 7 months ago
FACT - a framework for the functional interpretation of high-throughput experiments
Background: Interpreting the results of high-throughput experiments, such as those obtained from DNA-microarrays, is an often time-consuming task due to the high number of data-po...
Felix Kokocinski, Nicolas Delhomme, Gunnar Wrobel,...
APPROX
2009
Springer
112views Algorithms» more  APPROX 2009»
14 years 2 months ago
Deterministic Approximation Algorithms for the Nearest Codeword Problem
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
Noga Alon, Rina Panigrahy, Sergey Yekhanin