Sciweavers

1760 search results - page 163 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
SODA
2012
ACM
203views Algorithms» more  SODA 2012»
11 years 10 months ago
Black-box reductions for cost-sharing mechanism design
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
Konstantinos Georgiou, Chaitanya Swamy
DCC
2004
IEEE
14 years 7 months ago
Semi-Lossless Text Compression
A new notion, that of semi-lossless text compression, is introduced, and its applicability in various settings is investigated. First results suggest that it might be hard to explo...
Yair Kaufman, Shmuel T. Klein
IPPS
2008
IEEE
14 years 2 months ago
Absolute Slicing in Peer-to-peer Systems
Peer-to-peer (P2P) systems are slowly moving from application-specific architectures to a generic serviceoriented design framework. The idea is to allow a dynamic collection of P...
Alberto Montresor, Roberto Zandonati
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
14 years 3 months ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers
TON
2010
162views more  TON 2010»
13 years 2 months ago
The Delay-Friendliness of TCP for Real-Time Traffic
TCP has traditionally been considered inappropriate for real-time applications. Nonetheless, popular applications such as Skype use TCP since UDP packets cannot pass through restri...
Eli Brosh, Salman Abdul Baset, Vishal Misra, Dan R...