Sciweavers

4369 search results - page 772 / 874
» Multiple View Vision
Sort
View
FUIN
2006
98views more  FUIN 2006»
14 years 10 months ago
On-line Approximate String Matching in Natural Language
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
Kimmo Fredriksson
NAR
2008
107views more  NAR 2008»
14 years 10 months ago
ISPIDER Central: an integrated database web-server for proteomics
Despite the growing volumes of proteomic data, integration of the underlying results remains problematic owing to differences in formats, data captured, protein accessions and ser...
Jennifer A. Siepen, Khalid Belhajjame, Julian N. S...
BMCBI
2005
163views more  BMCBI 2005»
14 years 9 months ago
Alkahest NuclearBLAST: a user-friendly BLAST management and analysis system
Background -: Sequencing of EST and BAC end datasets is no longer limited to large research groups. Drops in per-base pricing have made high throughput sequencing accessible to in...
Stephen E. Diener, Thomas D. Houfek, Sam E. Kalat,...
MST
2000
86views more  MST 2000»
14 years 9 months ago
Team Learning of Computable Languages
A team of learning machines is a multiset of learning machines. A team is said to successfully learn a concept just in case each member of some nonempty subset, of predetermined s...
Sanjay Jain, Arun Sharma
MST
2007
167views more  MST 2007»
14 years 9 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...