Sciweavers

2168 search results - page 338 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
ECCV
2004
Springer
15 years 8 months ago
Robust Encoding of Local Ordinal Measures: A General Framework of Iris Recognition
Abstract. The randomness of iris pattern makes it one of the most reliable biometric traits. On the other hand, the complex iris image structure and various sources of intra-class ...
Zhenan Sun, Tieniu Tan, Yunhong Wang
SIGMOD
2000
ACM
141views Database» more  SIGMOD 2000»
15 years 7 months ago
Counting, Enumerating, and Sampling of Execution Plans in a Cost-Based Query Optimizer
Testing an SQL database system by running large sets of deterministic or stochastic SQL statements is common practice in commercial database development. However, code defects oft...
Florian Waas, César A. Galindo-Legaria
ICCVW
1999
Springer
15 years 7 months ago
A General Method for Feature Matching and Model Extraction
Abstract. Popular algorithms for feature matching and model extraction fall into two broad categories, generate-and-test and Hough transform variations. However, both methods su er...
Clark F. Olson
COCO
1998
Springer
98views Algorithms» more  COCO 1998»
15 years 7 months ago
Probabilistic Martingales and BPTIME Classes
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness propert...
Kenneth W. Regan, D. Sivakumar
KDD
2000
ACM
115views Data Mining» more  KDD 2000»
15 years 6 months ago
Mining asynchronous periodic patterns in time series data
Periodicy detection in time series data is a challenging problem of great importance in many applications. Most previous work focused on mining synchronous periodic patterns and d...
Jiong Yang, Wei Wang 0010, Philip S. Yu