Sciweavers

1385 search results - page 163 / 277
» Clustering by Random Projections
Sort
View
ICASSP
2009
IEEE
16 years 1 months ago
Compressive confocal microscopy
In this paper, a new approach for Confocal Microscopy (CM) based on the framework of compressive sensing is developed. In the proposed approach, a point illumination and a random ...
Peng Ye, José L. Paredes, Gonzalo R. Arce, ...
FOCS
2007
IEEE
16 years 23 days ago
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
Jonathan A. Kelner, Evdokia Nikolova
CVPR
2009
IEEE
1695views Computer Vision» more  CVPR 2009»
17 years 1 months ago
Geometric min-Hashing: Finding a (Thick) Needle in a Haystack
We propose a novel hashing scheme for image retrieval, clustering and automatic object discovery. Unlike commonly used bag-of-words approaches, the spatial extent of image featu...
Ondrej Chum (Czech Technical University), Michal P...
ICS
2010
Tsinghua U.
16 years 3 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
DFT
2007
IEEE
142views VLSI» more  DFT 2007»
16 years 23 days ago
Quantitative Analysis of In-Field Defects in Image Sensor Arrays
Growth of pixel density and sensor array size increases the likelihood of developing in-field pixel defects. An ongoing study on defect development in imagers has now provided us ...
Jenny Leung, Jozsef Dudas, Glenn H. Chapman, Israe...