3360 search results - page 481 / 672 » Opportunistic Data Structures with Applications |
146
click to vote
SC
2009
ACM
15 years 11 months ago
2009
ACM
We present a scalable temporal order analysis technique that supports debugging of large scale applications by classifying MPI tasks based on their logical program execution order...
169
click to vote
CIKM
2011
Springer
14 years 4 months ago
2011
Springer
A continuous top-k query retrieves the k most preferred objects in a data stream according to a given preference function. These queries are important for a broad spectrum of appl...
167
click to vote
WWW
2003
ACM
16 years 5 months ago
2003
ACM
Recent advances in information retrieval over hyperlinked corpora have convincinglydemonstratedthat links carry less noisy information than text. We investigate the feasibility of...
146
click to vote
CA
1999
IEEE
15 years 9 months ago
1999
IEEE
The continuously increasing complexity of computer animationsmakes it necessary to rely on the knowledge of various experts to cover the different areas of computer graphics and a...
161
click to vote
ASPLOS
1996
ACM
15 years 9 months ago
1996
ACM
This paper describes Shasta, a system that supports a shared address space in software on clusters of computers with physically distributed memory. A unique aspect of Shasta compa...