Sciweavers

170 search results - page 29 / 34
» Reducing the Number of Queries in Interactive Value Iteratio...
Sort
View
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
15 years 10 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur
ICDE
1999
IEEE
209views Database» more  ICDE 1999»
15 years 11 months ago
Efficient Time Series Matching by Wavelets
Time series stored as feature vectors can be indexed by multidimensional index trees like R-Trees for fast retrieval. Due to the dimensionality curse problem, transformations are ...
Kin-pong Chan, Ada Wai-Chee Fu
ICVGIP
2004
14 years 11 months ago
Local Correlation-based Fingerprint Matching
Most fingerprint matching systems are based on matching minutia points between two fingerprint images. Each minutia is represented by a fixed number of attributes such as the loca...
Karthik Nandakumar, Anil K. Jain
BMCBI
2011
14 years 4 months ago
Flexible taxonomic assignment of ambiguous sequencing reads
Background: To characterize the diversity of bacterial populations in metagenomic studies, sequencing reads need to be accurately assigned to taxonomic units in a given reference ...
José Carlos Clemente, Jesper Jansson, Gabri...
CN
2004
108views more  CN 2004»
14 years 9 months ago
Smart dust, friend or foe?--Replacing identity with configuration trust
Smart dust motes are miniature self-contained systems that may be deployed in very large numbers. In military applications these devices are subject to different threats than conv...
Howard Chivers, John A. Clark