1632 search results - page 50 / 327 » Sublinear Time Algorithms for Metric Space Problems |
124
click to vote
CIKM
2004
Springer
15 years 9 months ago
2004
Springer
Mining massive temporal data streams for significant trends, emerging buzz, and unusually high or low activity is an important problem with several commercial applications. In th...
203
click to vote
ESA
2010
Springer
15 years 5 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
132
click to vote
GLOBECOM
2006
IEEE
15 years 10 months ago
2006
IEEE
— This paper considers the problem of finding the path with minimum (zero) worst possible number of errors in a network with V nodes where (1) some nodes are capable of correcti...
151
click to vote
KDD
2007
ACM
16 years 4 months ago
2007
ACM
Summarization is an important task in data mining. A major challenge over the past years has been the efficient construction of fixed-space synopses that provide a deterministic q...
140
click to vote
RSS
2007
15 years 5 months ago
2007
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...