Sciweavers

4850 search results - page 287 / 970
» Approximate Data Structures with Applications
Sort
View
WEA
2007
Springer
131views Algorithms» more  WEA 2007»
16 years 23 days ago
On the Cost of Persistence and Authentication in Skip Lists
We present an extensive experimental study of authenticated data structures for dictionaries and maps implemented with skip lists. We consider realizations of these data structures...
Michael T. Goodrich, Charalampos Papamanthou, Robe...
EUROPAR
2001
Springer
15 years 11 months ago
Experiments in Parallel Clustering with DBSCAN
We present a new result concerning the parallelisation of DBSCAN, a Data Mining algorithm for density-based spatial clustering. The overall structure of DBSCAN has been mapped to a...
Domenica Arlia, Massimo Coppola
ICEIS
2003
IEEE
15 years 12 months ago
Code Generation for Distributed Systems
d graphically, interest in code generators which create applications based on abstract system descriptions, is high. An indicator for this are the many commercial products. This pa...
Markus Aleksy, Ralf Gitzel
PPOPP
2003
ACM
15 years 12 months ago
Exploiting high-level coherence information to optimize distributed shared state
InterWeave is a distributed middleware system that supports the sharing of strongly typed, pointer-rich data structures across a wide variety of hardware architectures, operating ...
DeQing Chen, Chunqiang Tang, Brandon Sanders, Sand...
KDD
2000
ACM
101views Data Mining» more  KDD 2000»
15 years 10 months ago
Incremental quantile estimation for massive tracking
Data--call records, internet packet headers, or other transaction records--are coming down a pipe at a ferocious rate, and we need to monitor statistics of the data. There is no r...
Fei Chen, Diane Lambert, José C. Pinheiro