1632 search results - page 112 / 327 » Sublinear Time Algorithms for Metric Space Problems |
127
Voted
KDD
2009
ACM
16 years 4 months ago
2009
ACM
Classification of time series has been attracting great interest over the past decade. Recent empirical evidence has strongly suggested that the simple nearest neighbor algorithm ...
123
Voted
CPC
2006
15 years 3 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
130
Voted
PVLDB
2010
15 years 2 months ago
2010
Violations of functional dependencies (FDs) are common in practice, often arising in the context of data integration or Web data extraction. Resolving these violations is known to...
149
Voted
SODA
2008
ACM
15 years 5 months ago
2008
ACM
We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...
141
Voted
SIGMETRICS
2005
ACM
15 years 9 months ago
2005
ACM
In addition to providing small mean response times, modern applications seek to provide users predictable service and, in some cases, Quality of Service (QoS) guarantees. In order...