Sciweavers

2463 search results - page 38 / 493
» Compressing Pattern Databases
Sort
View
ICDM
2008
IEEE
96views Data Mining» more  ICDM 2008»
14 years 2 months ago
Filling in the Blanks - Krimp Minimisation for Missing Data
Many data sets are incomplete. For correct analysis of such data, one can either use algorithms that are designed to handle missing data or use imputation. Imputation has the bene...
Jilles Vreeken, Arno Siebes
AMFG
2005
IEEE
183views Biometrics» more  AMFG 2005»
13 years 9 months ago
Robust Automatic Human Identification Using Face, Mouth, and Acoustic Information
Discriminatory information about person identity is multimodal. Yet, most person recognition systems are unimodal, e.g. the use of facial appearance. With a view to exploiting the ...
Niall A. Fox, Ralph Gross, Jeffrey F. Cohn, Richar...
TVLSI
2010
13 years 2 months ago
Test Data Compression Using Efficient Bitmask and Dictionary Selection Methods
Abstract--Higher circuit densities in system-on-chip (SOC) designs have led to drastic increase in test data volume. Larger test data size demands not only higher memory requiremen...
Kanad Basu, Prabhat Mishra
APPROX
2004
Springer
89views Algorithms» more  APPROX 2004»
13 years 11 months ago
The Sketching Complexity of Pattern Matching
Abstract. We address the problems of pattern matching and approximate pattern matching in the sketching model. We show that it is impossible to compress the text into a small sketc...
Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, ...
IMCSIT
2010
13 years 5 months ago
Finding Patterns in Strings using Suffixarrays
Abstract--Finding regularities in large data sets requires implementations of systems that are efficient in both time and space requirements. Here, we describe a newly developed sy...
Herman Stehouwer, Menno van Zaanen