Sciweavers

4536 search results - page 62 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
CCGRID
2004
IEEE
14 years 22 days ago
Evolutionary molecular structure determination using Grid-enabled data mining
A new computational framework is developed for the evolutionary determination of molecular crystal structures using the Shake-and-Bake methodology. Genetic algorithms are performe...
Mark L. Green, Russ Miller
PODC
2004
ACM
14 years 2 months ago
Load balancing and locality in range-queriable data structures
We describe a load-balancing mechanism for assigning elements to servers in a distributed data structure that supports range queries. The mechanism ensures both load-balancing wit...
James Aspnes, Jonathan Kirsch, Arvind Krishnamurth...
SIGCOMM
2010
ACM
13 years 9 months ago
DDE: dynamic data structure excavation
Dynamic Datastructure Excavation (DDE) is a new approach to extract datastructures from C binaries without any need for debugging symbols. Unlike most existing tools, DDE uses dyn...
Asia Slowinska, Traian Stancescu, Herbert Bos
ICML
2002
IEEE
14 years 9 months ago
Kernels for Semi-Structured Data
Semi-structured data such as XML and HTML is attracting considerable attention. It is important to develop various kinds of data mining techniques that can handle semistructured d...
Hisashi Kashima, Teruo Koyanagi
PCI
2005
Springer
14 years 2 months ago
Storing and Locating Mutable Data in Structured Peer-to-Peer Overlay Networks
Structured peer-to-peer overlay networks or Distributed Hash Tables (DHTs) are distributed systems optimized for storage and retrieval of read-only data. In this paper we elaborate...
Antony Chazapis, Nectarios Koziris