Sciweavers

1322 search results - page 140 / 265
» Parameterized counting problems
Sort
View
GD
2006
Springer
14 years 1 months ago
Schematisation of Tree Drawings
Given a tree T spanning a set of points S in the plane, we study the problem of drawing T using only line segments aligned with a fixed set of directions C. The vertices in the dra...
Joachim Gudmundsson, Marc J. van Kreveld, Damian M...
ADCM
2010
92views more  ADCM 2010»
13 years 10 months ago
Construction of infinite unimodular sequences with zero autocorrelation
Unimodular waveforms x are constructed on the integers with the property that the autocorrelation of x is one at the origin and zero elsewhere. There are three different constructi...
John J. Benedetto, Somantika Datta
ALGORITHMICA
2008
82views more  ALGORITHMICA 2008»
13 years 10 months ago
Random Bichromatic Matchings
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
Nayantara Bhatnagar, Dana Randall, Vijay V. Vazira...
TOG
2008
85views more  TOG 2008»
13 years 10 months ago
Robust treatment of simultaneous collisions
Robust treatment of complex collisions is a challenging problem in cloth simulation. Some state of the art methods resolve collisions iteratively, invoking a fail-safe when a boun...
David Harmon, Etienne Vouga, Rasmus Tamstorf, Eita...
ACL
2010
13 years 8 months ago
Training Phrase Translation Models with Leaving-One-Out
Several attempts have been made to learn phrase translation probabilities for phrasebased statistical machine translation that go beyond pure counting of phrases in word-aligned t...
Joern Wuebker, Arne Mauser, Hermann Ney