5169 search results - page 694 / 1034 » Locality approximation using time |
145
Voted
CAV
2009
Springer
16 years 6 months ago
2009
Springer
Window Abstraction for Infinite Markov Chains Thomas A. Henzinger1 , Maria Mateescu1 , and Verena Wolf1,2 1 EPFL, Switzerland 2 Saarland University, Germany Abstract. We present an...
162
Voted
KDD
2004
ACM
16 years 6 months ago
2004
ACM
In many applications that track and analyze spatiotemporal data, movements obey periodic patterns; the objects follow the same routes (approximately) over regular time intervals. ...
190
Voted
PODS
2001
ACM
16 years 6 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
147
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
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...
126
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...