Sciweavers

496 search results - page 73 / 100
» C4-saturated bipartite graphs
Sort
View
SODA
2008
ACM
93views Algorithms» more  SODA 2008»
13 years 10 months ago
Fast load balancing via bounded best response
It is known that the dynamics of best response in an environment of non-cooperative users may converge to a good solution when users play sequentially, but may cycle far away from...
Baruch Awerbuch, Yossi Azar, Rohit Khandekar
ACL
2006
13 years 10 months ago
Optimal Constituent Alignment with Edge Covers for Semantic Projection
Given a parallel corpus, semantic projection attempts to transfer semantic role annotations from one language to another, typically by exploiting word alignments. In this paper, w...
Sebastian Padó, Mirella Lapata
SODA
2004
ACM
87views Algorithms» more  SODA 2004»
13 years 10 months ago
Optimal space lower bounds for all frequency moments
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
David P. Woodruff
CORR
2006
Springer
142views Education» more  CORR 2006»
13 years 9 months ago
Decentralized Erasure Codes for Distributed Networked Storage
We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes wit...
Alexandros G. Dimakis, Vinod M. Prabhakaran, Kanna...
DISOPT
2007
93views more  DISOPT 2007»
13 years 9 months ago
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer together with a set S of wo...
Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak...