Sciweavers

7006 search results - page 356 / 1402
» Approximation Algorithms
Sort
View
COMPGEOM
2008
ACM
15 years 6 months ago
Circular partitions with applications to visualization and embeddings
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
Krzysztof Onak, Anastasios Sidiropoulos
CVPR
2008
IEEE
16 years 6 months ago
Approximate earth mover's distance in linear time
The earth mover's distance (EMD) [16] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 log N)) computational complexity...
Sameer Shirdhonkar, David W. Jacobs
ECCV
2000
Springer
15 years 8 months ago
Approximate N-View Stereo
This paper introduces a new multi-view reconstruction problem called approximate N -view stereo. The goal of this problem is to recover a oneparameter family of volumes that are in...
Kiriakos N. Kutulakos
ALGOSENSORS
2008
Springer
15 years 6 months ago
Target Counting under Minimal Sensing: Complexity and Approximations
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
Sorabh Gandhi, Rajesh Kumar 0003, Subhash Suri
PAKDD
2005
ACM
112views Data Mining» more  PAKDD 2005»
15 years 10 months ago
Approximated Clustering of Distributed High-Dimensional Data
In many modern application ranges high-dimensional feature vectors are used to model complex real-world objects. Often these objects reside on different local sites. In this paper,...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...