Sciweavers

70 search results - page 14 / 14
» Characterizing and Exploiting Reference Locality in Data Str...
Sort
View
VLDB
2008
ACM
127views Database» more  VLDB 2008»
14 years 5 months ago
Delay aware querying with Seaweed
Large highly distributed data sets are poorly supported by current query technologies. Applications such as endsystembased network management are characterized by data stored on l...
Dushyanth Narayanan, Austin Donnelly, Richard Mort...
INFOCOM
2005
IEEE
13 years 11 months ago
Assisted peer-to-peer search with partial indexing
—In the past few years, peer-to-peer (P2P) networks have become a promising paradigm for building a wide variety of distributed systems and applications. The most popular P2P app...
Rongmei Zhang, Y. Charlie Hu
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
13 years 11 months ago
On adequate performance measures for paging
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
Konstantinos Panagiotou, Alexander Souza
VISUALIZATION
1991
IEEE
13 years 8 months ago
A Tool for Visualizing the Topology of Three-Dimensional Vector Fields
We describe a software system, TOPO, that numerically analyzes and graphically displays topological aspects of a three dimensional vector field, v, to produce a single, relativel...
Al Globus, C. Levit, T. Lasinski
BMCBI
2002
131views more  BMCBI 2002»
13 years 5 months ago
Efficient Boolean implementation of universal sequence maps (bUSM)
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...
John Schwacke, Jonas S. Almeida