Sciweavers

6368 search results - page 220 / 1274
» Modeling Problem Transformations based on Data Complexity
Sort
View
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
16 years 7 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh
NIPS
2003
15 years 8 months ago
Learning the k in k-means
When clustering a dataset, the right number k of clusters to use is often not obvious, and choosing k automatically is a hard algorithmic problem. In this paper we present an impr...
Greg Hamerly, Charles Elkan
JMIV
2010
131views more  JMIV 2010»
15 years 5 months ago
An SL(2) Invariant Shape Median
Median averaging is a powerful averaging concept on sets of vector data in finite dimensions. A generalization of the median for shapes in the plane is introduced. The underlying ...
Benjamin Berkels, Gina Linkmann, Martin Rumpf
PAMI
2006
138views more  PAMI 2006»
15 years 6 months ago
Context-Based Segmentation of Image Sequences
We describe an algorithm for context-based segmentation of visual data. New frames in an image sequence (video) are segmented based on the prior segmentation of earlier frames in ...
Jacob Goldberger, Hayit Greenspan
ICDAR
2009
IEEE
15 years 4 months ago
Clutter Noise Removal in Binary Document Images
The paper presents a clutter detection and removal algorithm for complex document images. The distance transform based approach is independent of clutter's position, size, sh...
Mudit Agrawal, David S. Doermann