Sciweavers

2979 search results - page 324 / 596
» Computation and the Periodic Table
Sort
View
ICPP
2008
IEEE
16 years 1 months ago
Bounded LSH for Similarity Search in Peer-to-Peer File Systems
Similarity search has been widely studied in peer-to-peer environments. In this paper, we propose the Bounded Locality Sensitive Hashing (Bounded LSH) method for similarity search...
Yu Hua, Bin Xiao, Dan Feng, Bo Yu
IDEAS
2008
IEEE
105views Database» more  IDEAS 2008»
16 years 1 months ago
Pruning attribute values from data cubes with diamond dicing
Data stored in a data warehouse are inherently multidimensional, but most data-pruning techniques (such as iceberg and top-k queries) are unidimensional. However, analysts need to...
Hazel Webb, Owen Kaser, Daniel Lemire
AINA
2007
IEEE
16 years 29 days ago
DHTs over Peer Clusters for Distributed Information Retrieval
Distributed Hash Tables (DHTs) are very efficient for querying based on key lookups, if only a small number of keys has to be registered by each individual peer. However, building...
Odysseas Papapetrou, Wolf Siberski, Wolf-Tilo Balk...
FOCS
2007
IEEE
16 years 28 days ago
Strongly History-Independent Hashing with Applications
We present a strongly history independent (SHI) hash table that supports search in O(1) worst-case time, and insert and delete in O(1) expected time using O(n) data space. This ma...
Guy E. Blelloch, Daniel Golovin
ICDCSW
2007
IEEE
16 years 28 days ago
UBCA: Utility-Based Clustering Architecture for Peer-to-Peer Systems
Peer-to-Peer (P2P) systems are currently used in a variety of applications. File sharing applications and ad hoc networking have fueled the usage of these systems. P2P systems gen...
Brent Lagesse, Mohan Kumar