7006 search results - page 899 / 1402 » Approximation Algorithms |
212
click to vote
PODC
2006
ACM
16 years 1 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
199
click to vote
ICRA
2005
IEEE
16 years 1 months ago
2005
IEEE
— This paper presents the novel insight that the SLAM information matrix is exactly sparse in a delayedstate framework. Such a framework is used in view-based representations of ...
201
click to vote
ISAAC
2004
Springer
16 years 1 months ago
2004
Springer
We propose a space-efficient scheme for summarizing multidimensional data streams. Our sketch can be used to solve spatial versions of several classical data stream queries effici...
251
click to vote
KDD
2004
ACM
16 years 1 months ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
196
click to vote
DIALM
2003
ACM
16 years 29 days ago
2003
ACM
A common way of storing spatio-temporal information about mobile devices is in the form of a 3D (2D geography + time) trajectory. We argue that when cellular phones and Personal D...