Sciweavers

2342 search results - page 234 / 469
» Sublinear geometric algorithms
Sort
View
COMPGEOM
2006
ACM
16 years 14 days ago
Vines and vineyards by updating persistence in linear time
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing o...
David Cohen-Steiner, Herbert Edelsbrunner, Dmitriy...
DC
2008
15 years 6 months ago
Approximate distributed top- k queries
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...
Boaz Patt-Shamir, Allon Shafrir
CORR
2010
Springer
81views Education» more  CORR 2010»
15 years 1 months ago
Analysis of Agglomerative Clustering
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
Marcel R. Ackermann, Johannes Blömer, Daniel ...
ICCV
2009
IEEE
16 years 11 months ago
Structure- and Motion-adaptive Regularization for High Accuracy Optic Flow
The accurate estimation of motion in image sequences is of central importance to numerous computer vision applications. Most competitive algorithms compute flow fields by minimi...
Andreas Wedel, Daniel Cremers, Thomas Pock, Horst ...
ECCV
2004
Springer
16 years 8 months ago
Model Selection for Range Segmentation of Curved Objects
In the present paper, we address the problem of recovering the true underlying model of a surface while performing the segmentation. A novel criterion for surface (model) selection...
Alireza Bab-Hadiashar, Niloofar Gheissari