Sciweavers

6980 search results - page 885 / 1396
» Music, Complexity, Information
Sort
View
MT
2010
100views more  MT 2010»
15 years 5 months ago
Exploiting syntactic relationships in a phrase-based decoder: an exploration
Phrase-based decoding is conceptually simple and straightforward to implement, at the cost of drastically oversimplified reordering models. Syntactically aware models make it pos...
Tim Hunter, Philip Resnik
207
Voted
PSD
2010
Springer
108views Database» more  PSD 2010»
15 years 5 months ago
Disclosure Risk of Synthetic Population Data with Application in the Case of EU-SILC
In survey statistics, simulation studies are usually performed by repeatedly drawing samples from population data. Furthermore, population data may be used in courses on survey sta...
Matthias Templ, Andreas Alfons
SIROCCO
2010
15 years 5 months ago
Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots
We consider the problem of exploring an anonymous unoriented ring of size n by k identical, oblivious, asynchronous mobile robots, that are unable to communicate, yet have the abil...
Anissa Lamani, Maria Gradinariu Potop-Butucaru, S&...
186
Voted
SPIRE
2010
Springer
15 years 5 months ago
String Matching with Variable Length Gaps
We consider string matching with variable length gaps. Given a string T and a pattern P consisting of strings separated by variable length gaps (arbitrary strings of length in a sp...
Philip Bille, Inge Li Gørtz, Hjalte Wedel V...
205
Voted
SPIRE
2010
Springer
15 years 5 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie