Sciweavers

534 search results - page 20 / 107
» Power from Random Strings
Sort
View
ACL
1998
13 years 8 months ago
Conditions on Consistency of Probabilistic Tree Adjoining Grammars
Much of the power of probabilistic methods in modelling language comes from their ability to compare several derivations for the same string in the language. An important starting...
Anoop Sarkar
ISAAC
2004
Springer
115views Algorithms» more  ISAAC 2004»
14 years 23 days ago
Randomized Algorithms for Motif Detection
Motivation: Motif detection for DNA sequences has many important applications in biological studies, e.g., locating binding sites and regulatory signals, and designing genetic prob...
Lusheng Wang, Liang Dong, Hui Fan
ALT
2008
Springer
14 years 4 months ago
On-Line Probability, Complexity and Randomness
Abstract. Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situat...
Alexey V. Chernov, Alexander Shen, Nikolai K. Vere...
ECCV
2008
Springer
14 years 9 months ago
A Dynamic Conditional Random Field Model for Joint Labeling of Object and Scene Classes
Object detection and pixel-wise scene labeling have both been active research areas in recent years and impressive results have been reported for both tasks separately. The integra...
Christian Wojek, Bernt Schiele
CC
2007
Springer
123views System Software» more  CC 2007»
13 years 7 months ago
An Improved Analysis of Linear Mergers
Mergers are procedures that, with the aid of a short random string, transform k (possibly dependent) random sources into a single random source, in a way that ensures that if one ...
Zeev Dvir, Amir Shpilka