Sciweavers

4850 search results - page 772 / 970
» Approximate Data Structures with Applications
Sort
View
WWW
2003
ACM
16 years 5 months ago
Mining newsgroups using networks arising from social behavior
Recent advances in information retrieval over hyperlinked corpora have convincinglydemonstratedthat links carry less noisy information than text. We investigate the feasibility of...
Rakesh Agrawal, Sridhar Rajagopalan, Ramakrishnan ...
SC
2009
ACM
15 years 11 months ago
Scalable temporal order analysis for large scale debugging
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...
Dong H. Ahn, Bronis R. de Supinski, Ignacio Laguna...
CA
1999
IEEE
15 years 9 months ago
Collaborative Animation over the Network
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...
François Faure, Chris Faisstnauer, Gerd Hes...
ASPLOS
1996
ACM
15 years 9 months ago
Shasta: A Low Overhead, Software-Only Approach for Supporting Fine-Grain Shared Memory
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...
Daniel J. Scales, Kourosh Gharachorloo, Chandramoh...
CIKM
2011
Springer
14 years 4 months ago
MTopS: scalable processing of continuous top-k multi-query workloads
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...
Avani Shastri, Di Yang, Elke A. Rundensteiner, Mat...