Sciweavers

133 search results - page 18 / 27
» Simple and practical algorithm for sparse Fourier transform
Sort
View
IM
2008
13 years 7 months ago
Finding Strongly Knit Clusters in Social Networks
Social networks are ubiquitous. The discovery of close-knit clusters in these networks is of fundamental and practical interest. Existing clustering criteria are limited in that c...
Nina Mishra, Robert Schreiber, Isabelle Stanton, R...
MM
2010
ACM
158views Multimedia» more  MM 2010»
13 years 5 months ago
Image segmentation with patch-pair density priors
In this paper, we investigate how an unlabeled image corpus can facilitate the segmentation of any given image. A simple yet efficient multi-task joint sparse representation model...
Xiaobai Liu, Jiashi Feng, Shuicheng Yan, Hai Jin
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 7 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
ICIP
2009
IEEE
14 years 8 months ago
On The Empirical Rate-distortion Performance Of Compressive Sensing
Compressive Sensing (CS) is a new paradigm in signal acquisition and compression. In compressive sensing, a compressible signal is acquired using much less measurements than the o...
SGP
2007
13 years 9 months ago
As-rigid-as-possible surface modeling
Modeling tasks, such as surface deformation and editing, can be analyzed by observing the local behavior of the surface. We argue that defining a modeling operation by asking for ...
Olga Sorkine, Marc Alexa