658 search results - page 33 / 132 » Lower bounds for sorting networks |
177
click to vote
IPTPS
2003
Springer
15 years 10 months ago
2003
Springer
Koorde1 is a new distributed hash table (DHT) based on Chord [15] and the de Bruijn graphs [2]. While inheriting the simplicity of Chord, Koorde meets various lower bounds, such a...
152
click to vote
CDC
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract-- A network of nodes communicate via noisy channels. Each node has some real-valued initial measurement or message. The goal of each of the nodes is to acquire an estimate...
149
click to vote
WIOPT
2006
IEEE
15 years 11 months ago
2006
IEEE
Abstract— We investigate two quantities of fundamental interest in a mobile ad-hoc network: the capacity region and the minimum energy function of the network. The capacity regio...
147
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
159
click to vote
UAI
2004
15 years 7 months ago
2004
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...