Sciweavers

4843 search results - page 799 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
PODS
2003
ACM
116views Database» more  PODS 2003»
16 years 3 months ago
On nearest neighbor indexing of nonlinear trajectories
In recent years, the problem of indexing mobile objects has assumed great importance because of its relevance to a wide variety of applications. Most previous results in this area...
Charu C. Aggarwal, Dakshi Agrawal
PODS
2006
ACM
122views Database» more  PODS 2006»
16 years 3 months ago
Space- and time-efficient deterministic algorithms for biased quantiles over data streams
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...
127
Voted
EDBT
2004
ACM
142views Database» more  EDBT 2004»
16 years 3 months ago
Iterative Incremental Clustering of Time Series
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
Jessica Lin, Michail Vlachos, Eamonn J. Keogh, Dim...
125
Voted
EDBT
2008
ACM
160views Database» more  EDBT 2008»
16 years 3 months ago
Why go logarithmic if we can go linear?: Towards effective distinct counting of search traffic
Estimating the number of distinct elements in a large multiset has several applications, and hence has attracted active research in the past two decades. Several sampling and sket...
Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi
EDBT
2008
ACM
125views Database» more  EDBT 2008»
16 years 3 months ago
On the brink: searching for drops in sensor data
Sensor networks have been widely used to collect data about the environment. When analyzing data from these systems, people tend to ask exploratory questions--they want to find su...
Gong Chen, Junghoo Cho, Mark H. Hansen