Sciweavers

JACM
2007
113views more  JACM 2007»
13 years 11 months ago
On counting homomorphisms to directed acyclic graphs
Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson
JACM
2007
87views more  JACM 2007»
13 years 11 months ago
A testing scenario for probabilistic processes
Ling Cheung, Mariëlle Stoelinga, Frits W. Vaa...
JACM
2007
121views more  JACM 2007»
13 years 11 months ago
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...
JACM
2007
160views more  JACM 2007»
13 years 11 months ago
Lossless abstraction of imperfect information games
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
Andrew Gilpin, Tuomas Sandholm
JACM
2007
93views more  JACM 2007»
13 years 11 months ago
AdWords and generalized online matching
Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vij...
JACM
2007
79views more  JACM 2007»
13 years 11 months ago
A new look at survey propagation and its generalizations
This article provides a new conceptual perspective on survey propagation, which is an iterative algorithm recently introduced by the statistical physics community that is very effe...
Elitza N. Maneva, Elchanan Mossel, Martin J. Wainw...
JACM
2007
115views more  JACM 2007»
13 years 11 months ago
Optimal pants decompositions and shortest homotopic cycles on an orientable surface
We consider the problem of finding a shortest cycle (freely) homotopic to a given simple cycle on a compact, orientable surface. For this purpose, we use a pants decomposition of...
Éric Colin de Verdière, Francis Laza...
JACM
2007
92views more  JACM 2007»
13 years 11 months ago
Periodicity and unbordered words: A proof of the extended duval conjecture
The relationship between the length of a word and the maximum length of its unbordered factors is investigated in this paper. Consider a finite word w of length n. We call a word...
Tero Harju, Dirk Nowotka