Sciweavers

4313 search results - page 358 / 863
» Using time travel to diagnose computer problems
Sort
View
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
16 years 8 months ago
Training structural svms with kernels using sampled cuts
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...
Chun-Nam John Yu, Thorsten Joachims
BMCBI
2006
95views more  BMCBI 2006»
15 years 7 months ago
Discrete profile comparison using information bottleneck
Sequence homologs are an important source of information about proteins. Amino acid profiles, representing the position-specific mutation probabilities found in profiles, are a ri...
Sean O'Rourke, Gal Chechik, Robin Friedman, Eleaza...
JASIS
2000
143views more  JASIS 2000»
15 years 7 months ago
Discovering knowledge from noisy databases using genetic programming
s In data mining, we emphasize the need for learning from huge, incomplete and imperfect data sets (Fayyad et al. 1996, Frawley et al. 1991, Piatetsky-Shapiro and Frawley, 1991). T...
Man Leung Wong, Kwong-Sak Leung, Jack C. Y. Cheng
ICAPR
2005
Springer
16 years 1 months ago
Fingerprint Image Enhancement Using STFT Analysis
Contrary to popular belief, despite decades of research in fingerprints, reliable fingerprint recognition is an open problem. Extracting features out of poor quality prints is t...
Sharat Chikkerur, Venu Govindaraju, Alexander N. C...
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 11 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers