Sciweavers

2089 search results - page 52 / 418
» A New Problem in String Searching
Sort
View
CORR
2002
Springer
83views Education» more  CORR 2002»
14 years 9 months ago
Optimal Ordered Problem Solver
We introduce a general and in a certain sense time-optimal way of solving one problem after another, efficiently searching the space of programs that compute solution candidates, i...
Jürgen Schmidhuber
FLAIRS
2004
14 years 11 months ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar
SIGMOD
2009
ACM
134views Database» more  SIGMOD 2009»
15 years 10 months ago
Extending autocompletion to tolerate errors
Autocompletion is a useful feature when a user is doing a look up from a table of records. With every letter being typed, autocompletion displays strings that are present in the t...
Surajit Chaudhuri, Raghav Kaushik
ICASSP
2008
IEEE
15 years 4 months ago
Confidence estimation, OOV detection and language ID using phone-to-word transduction and phone-level alignments
Automatic Speech Recognition (ASR) systems continue to make errors during search when handling various phenomena including noise, pronunciation variation, and out of vocabulary (O...
Christopher M. White, Geoffrey Zweig, Lukas Burget...
RECOMB
2002
Springer
15 years 10 months ago
Revealing protein structures: a new method for mapping antibody epitopes
A recent idea for determining the three-dimensional structure of a protein uses antibody recognition of surface structure and random peptide libraries to map antibody epitope comb...
Brendan Mumey, Brian W. Bailey, Edward A. Dratz