Sciweavers

2009 search results - page 69 / 402
» Dense Interest Points
Sort
View
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
14 years 8 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
SENSYS
2003
ACM
14 years 1 months ago
An evaluation of multi-resolution storage for sensor networks
Wireless sensor networks enable dense sensing of the environment, offering unprecedented opportunities for observing the physical world. Centralized data collection and analysis a...
Deepak Ganesan, Ben Greenstein, Denis Perelyubskiy...
TAMC
2010
Springer
14 years 1 months ago
Community Structure in Large Complex Networks
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...
Liaoruo Wang, John E. Hopcroft
ICPR
2010
IEEE
13 years 10 months ago
Geodesic Active Fields on the Sphere
In this paper, we propose a novel method to register images defined on spherical meshes. Instances of such spherical images include inflated cortical feature maps in brain medical ...
Dominique Zosso, Jean-Philippe Thiran
SODA
2008
ACM
144views Algorithms» more  SODA 2008»
13 years 9 months ago
Fast dimension reduction using Rademacher series on dual BCH codes
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
Nir Ailon, Edo Liberty