1632 search results - page 47 / 327 » Sublinear Time Algorithms for Metric Space Problems |
156
click to vote
PODS
2010
ACM
15 years 11 months ago
2010
ACM
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
162
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
We present a practical, stratified autocalibration algorithm with theoretical guarantees of global optimality. Given a projective reconstruction, the first stage of the algorithm ...
158
click to vote
ACSC
2002
IEEE
15 years 11 months ago
2002
IEEE
Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its spac...
199
click to vote
ICMLA
2008
15 years 7 months ago
2008
Time-series segmentation in the fully unsupervised scenario in which the number of segment-types is a priori unknown is a fundamental problem in many applications. We propose a Ba...
176
click to vote
FAW
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Computing the visibility polygon, VP, of a point in a polygonal scene, is a classical problem that has been studied extensively. In this paper, we consider the problem of...