Sciweavers

169 search results - page 6 / 34
» Balanced Two-sided Matching
Sort
View
DAS
2008
Springer
13 years 9 months ago
Accurate Alignment of Double-Sided Manuscripts for Bleed-Through Removal
Double-sided manuscripts are often degraded by bleedthrough interference. Such degradation must be corrected to facilitate human perception and machine recognition. Most approache...
Jie Wang, Michael S. Brown, Chew Lim Tan
NBIS
2007
Springer
14 years 1 months ago
Implementing Range Queries with a Decentralized Balanced Tree over Distributed Hash Tables
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...
Nuno Lopes, Carlos Baquero
EJC
2010
13 years 7 months ago
Perfect matchings with restricted intersection in cubic graphs
A conjecture of G. Fan and A. Raspaud asserts that every bridgeless cubic graph contains three perfect matchings with empty intersection. We suggest a possible approach to problem...
Tomás Kaiser, André Raspaud
ICALP
2009
Springer
14 years 8 months ago
Smoothed Analysis of Balancing Networks
Abstract In a load balancing network each processor has an initial collection of unit-size jobs, tokens, and in each round, pairs of processors connected by balancers split their l...
Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik
LCN
2008
IEEE
14 years 2 months ago
Range queries and load balancing in a hierarchically structured P2P system
—Structured Peer-to-Peer (P2P) systems are highly scalable, self-organizing, and support efficient lookups. Furthermore, Distributed Hash Tables (DHTs), due to their features, a...
Simon Rieche, Bui The Vinh, Klaus Wehrle