7150 search results - page 333 / 1430 » An Approximation Algorithm for Approximation Rank |
144
Voted
SCALESPACE
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We propose a new complete method to extract significant description(s) of planar curves according to constant curvature segments. This method is based (i) on a multi-sca...
181
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Interactive dynamic influence diagrams (I-DIDs) are graphical models for sequential decision making in uncertain settings shared by other agents. Algorithms for solving I-DIDs fac...
201
click to vote
CIKM
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we propose an approach for efficient approximative RkNN search in arbitrary metric spaces where the value of k is specified at query time. Our method uses an approx...
200
click to vote
DCOSS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We propose a distributed scheme called Adaptive-GroupMerge for sensor networks that, given a parameter k, approximates a geometric shape by a k-vertex polygon. The algori...
183
click to vote
DAWAK
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...