Sciweavers

1302 search results - page 128 / 261
» On the Strong Chromatic Number
Sort
View
SPAA
2005
ACM
16 years 1 days ago
Dynamic circular work-stealing deque
The non-blocking work-stealing algorithm of Arora, Blumofe, and Plaxton (henceforth ABP work-stealing) is on its way to becoming the multiprocessor load balancing technology of ch...
David Chase, Yossi Lev
CTRSA
2005
Springer
88views Cryptology» more  CTRSA 2005»
16 years 1 days ago
Sub-linear Queries Statistical Databases: Privacy with Power
Abstract. We consider a statistical database in which a trusted administrator introduces noise to the query responses with the goal of maintaining privacy of individual database en...
Cynthia Dwork
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
16 years 1 days ago
Making Chord Robust to Byzantine Attacks
Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the...
Amos Fiat, Jared Saia, Maxwell Young
VLDB
2005
ACM
115views Database» more  VLDB 2005»
15 years 12 months ago
KLEE: A Framework for Distributed Top-k Query Algorithms
This paper addresses the efficient processing of top-k queries in wide-area distributed data repositories where the index lists for the attribute values (or text terms) of a query...
Sebastian Michel, Peter Triantafillou, Gerhard Wei...
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
15 years 12 months ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...