Sciweavers

3270 search results - page 249 / 654
» Approximate String Processing
Sort
View
CASCON
1997
85views Education» more  CASCON 1997»
15 years 4 months ago
Fast detection of communication patterns in distributed executions
Understanding distributed applications is a tedious and di cult task. Visualizations based on process-time diagrams are often used to obtain a better understanding of the executio...
Thomas Kunz, Michiel F. H. Seuren
92
Voted
TREC
2000
15 years 4 months ago
Goal-Driven Answer Extraction
We describe the structure and functioning of an answer-extraction system built from the ground up, in only three person-months, using shallow text-processing techniques. Underlyin...
Michael Laszlo, Leila Kosseim, Guy Lapalme
CONSTRAINTS
2008
182views more  CONSTRAINTS 2008»
15 years 3 months ago
Constraint Programming in Structural Bioinformatics
Bioinformatics aims at applying computer science methods to the wealth of data collected in a variety of experiments in life sciences (e.g. cell and molecular biology, biochemistry...
Pedro Barahona, Ludwig Krippahl
EC
2006
136views ECommerce» more  EC 2006»
15 years 3 months ago
Error Thresholds in Genetic Algorithms
The error threshold of replication is an important notion of the quasispecies evolution model; it is a critical mutation rate (error rate) beyond which structures obtained by an e...
Gabriela Ochoa
IDA
2006
Springer
15 years 3 months ago
Structural hidden Markov models: An application to handwritten numeral recognition
We introduce in this paper a generalization of the widely used hidden Markov models (HMM's), which we name "structural hidden Markov models" (SHMM). Our approach is ...
Djamel Bouchaffra, Jun Tan