4007 search results - page 209 / 802 » Computation with imprecise probabilities |
148
click to vote
ISMB
1998
15 years 5 months ago
1998
We describe a model for strings of characters that is loosely based on the Lempel Ziv model with the addition that a repeated substring can be an approximate match to the original...
166
click to vote
ISMB
1996
15 years 5 months ago
1996
This study demonstratesthe use of decision tree classifiers as the basis for a general gene-finding system. The system uses a dynamic programmingalgorithm that. finds the optimal ...
121
click to vote
CSDA
2008
15 years 4 months ago
2008
In this paper the concept of later waiting time distributions for patterns in multi-state trials is generalized to cover a collection of compound patterns that must all be counted...
174
click to vote
VISAPP
2007
15 years 5 months ago
2007
In this paper, we address the problem of robustly recovering several instances of a curve model from a single noisy data set with outliers. Using M-estimators revisited in a Lagran...
146
click to vote
APIN
2000
15 years 3 months ago
2000
The use of genetic programming for probabilistic pattern matching is investigated. A stochastic regular expression language is used. The language features a statistically sound sem...