6434 search results - page 838 / 1287 » The Dynamic Data Cube |
197
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various levels of cache, disk, etc.), but do not depend on the ...
162
click to vote
TAPSOFT
1993
Springer
15 years 11 months ago
1993
Springer
: We propose a new algebraic framework for exception handling which is powerful enough to cope with many exception handling features such that recovery, implicit propagation of exc...
196
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
197
click to vote
USENIX
1996
15 years 8 months ago
1996
This paper describes a new method for providingtransparent fault tolerance for parallel applications on a network of workstations. We have designed our method in the context of sh...
197
click to vote
MOBICOM
2010
ACM
15 years 7 months ago
2010
ACM
With widespread popularity of smart phones, more and more users are accessing the Internet on the go. Understanding mobile user browsing behavior is of great significance for seve...