Sciweavers

2600 search results - page 114 / 520
» Clustering with or without the Approximation
Sort
View
FOCS
1999
IEEE
15 years 5 months ago
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings
Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They have been used extensively in areas such as computer vision, pattern recog...
Martin Farach-Colton, Piotr Indyk
ESA
2006
Springer
136views Algorithms» more  ESA 2006»
15 years 5 months ago
Approximation in Preemptive Stochastic Online Scheduling
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
Nicole Megow, Tjark Vredeveld
JNS
2010
61views more  JNS 2010»
15 years 15 hour ago
Validity and Failure of the Boltzmann Approximation of Kinetic Annihilation
This paper introduces a new method to show the validity of a continuum description for the deterministic dynamics of many interacting particles. Here the many particle evolution is...
Karsten Matthies, Florian Theil
CGF
2008
121views more  CGF 2008»
15 years 1 months ago
Tensor Clustering for Rendering Many-Light Animations
Rendering animations of scenes with deformable objects, camera motion, and complex illumination, including indirect lighting and arbitrary shading, is a long-standing challenge. P...
Milos Hasan, Edgar Velázquez-Armendá...
CVPR
1998
IEEE
16 years 3 months ago
Clustering Appearances of 3D Objects
We introduce a method for unsupervised clustering of images of 3D objects. Our method examines the space of all images and partitions the images into sets that form smooth and par...
Ronen Basri, Dan Roth, David W. Jacobs