Sciweavers

3019 search results - page 35 / 604
» Approximating the Domatic Number
Sort
View
ICIP
2007
IEEE
16 years 1 months ago
Hierarchical Tensor Approximation of Multidimensional Images
Visual data comprises of multi-scale and inhomogeneous signals. In this paper, we exploit these characteristics and develop an adaptive data approximation technique based on a hie...
Qing Wu, Tian Xia, Yizhou Yu
ICDT
2005
ACM
149views Database» more  ICDT 2005»
15 years 5 months ago
Approximately Dominating Representatives
We propose and investigate from the algorithmic standpoint a novel form of fuzzy query called approximately dominating representatives or ADRs. The ADRs of a multidimensional point...
Vladlen Koltun, Christos H. Papadimitriou
WADS
2007
Springer
145views Algorithms» more  WADS 2007»
15 years 6 months ago
Approximate Shortest Paths Guided by a Small Index
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the ori...
Jörg Derungs, Riko Jacob, Peter Widmayer
ICRA
2006
IEEE
119views Robotics» more  ICRA 2006»
15 years 5 months ago
Polygonal Approximation of Laser Range Data based on Perceptual Grouping and EM
— Our goal is polygonal approximation of laser range data points obtained by a mobile robot. The proposed approach provides a precise estimation of the number of model components...
Longin Jan Latecki, Rolf Lakämper
STOC
1996
ACM
101views Algorithms» more  STOC 1996»
15 years 4 months ago
The Space Complexity of Approximating the Frequency Moments
The frequency moments of a sequence containing mi elements of type i, for 1 i n, are the numbers Fk = n i=1 mk i . We consider the space complexity of randomized algorithms that...
Noga Alon, Yossi Matias, Mario Szegedy