12863 search results - page 2311 / 2573 » Dynamic Data Mining |
176
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
157
click to vote
MSS
2000
IEEE
15 years 8 months ago
2000
IEEE
Phoenix is a fault-tolerantreal-time network-attachedstorage device (NASD). Like other NASD architectures, Phoenix provides an object-based interface to data stored on network-att...
140
click to vote
ICRA
1999
IEEE
15 years 8 months ago
1999
IEEE
The mobile robot localization problem is decomposed into two stages attitude estimation followed by position estimation. The innovation of our method is the use of a smoother, in ...
145
click to vote
SIGMOD
1997
ACM
15 years 8 months ago
1997
ACM
The goal of the InfoSleuth project at MCC is to exploit and synthesize new technologies into a uni ed system that retrieves and processes information in an ever-changing network o...
115
click to vote
IPPS
1996
IEEE
15 years 8 months ago
1996
IEEE
In this paper, we study on the EREW-PRAM model a parallel solution to the extended set union problem with unlimited backtracking which maintains a dynamic partition of an n-elemen...