Sciweavers

5595 search results - page 793 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
ICCV
2005
IEEE
16 years 10 days ago
KALMANSAC: Robust Filtering by Consensus
We propose an algorithm to perform causal inference of the state of a dynamical model when the measurements are corrupted by outliers. While the optimal (maximumlikelihood) soluti...
Andrea Vedaldi, Hailin Jin, Paolo Favaro, Stefano ...
SIGIR
1998
ACM
15 years 11 months ago
Fast Searching on Compressed Text Allowing Errors
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
WISEC
2009
ACM
16 years 1 months ago
Towards a theory for securing time synchronization in wireless sensor networks
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
Murtuza Jadliwala, Qi Duan, Shambhu J. Upadhyaya, ...
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
16 years 8 days ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler
GRAPHICSINTERFACE
2007
15 years 8 months ago
Constrained planar remeshing for architecture
Material limitations and fabrication costs generally run at odds with the creativity of architectural design, producing a wealth of challenging computational geometry problems. We...
Barbara Cutler, Emily Whiting