2455 search results - page 276 / 491 » Computability of Models for Sequence Assembly |
163
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
170
click to vote
ESANN
2006
15 years 8 months ago
2006
We explore the capability of the Self Organizing Map for structured data (SOM-SD) to compress continuous time data recorded from a kinematic tree, which can represent a robot or an...
175
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true d...
181
click to vote
PR
2002
15 years 6 months ago
2002
Many approaches can track objects moving in sequences of images but can su er in occlusion and noise, and often require initialisation. These factors can be handled by techniques ...
163
click to vote
EMNLP
2010
15 years 4 months ago
2010
This paper proposes a fast and simple unsupervised word segmentation algorithm that utilizes the local predictability of adjacent character sequences, while searching for a leaste...