4536 search results - page 571 / 908 » Contention-Sensitive Data Structures and Algorithms |
197
click to vote
SIGCOMM
2005
ACM
16 years 9 days ago
2005
ACM
Recent research has shown that one can use Distributed Hash Tables (DHTs) to build scalable, robust and efficient applications. One question that is often left unanswered is that ...
172
click to vote
APLAS
2004
ACM
2004
ACM
Translation of Tree-Processing Programs into Stream-Processing Programs Based on Ordered Linear Type
16 years 5 days ago
There are two ways to write a program for manipulating tree-structured data such as XML documents: One is to write a tree-processing program focusing on the logical structure of t...
190
click to vote
DBKDA
2010
IEEE
15 years 12 months ago
2010
IEEE
Abstract—XML indexing and search has become an important topic, and twig joins are key building blocks in XML search systems. This paper describes a novel approach using a nested...
196
click to vote
KDD
2010
ACM
15 years 10 months ago
2010
ACM
In multi-label learning, each training example is associated with a set of labels and the task is to predict the proper label set for the unseen example. Due to the tremendous (ex...
206
click to vote
HPDC
1997
IEEE
15 years 10 months ago
1997
IEEE
High-performance execution in distributed computing environments often requires careful selection and configuration not only of computers, networks, and other resources but also o...