Sciweavers

478 search results - page 46 / 96
» Improving probability bounds by optimization over subsets
Sort
View
ICIP
2001
IEEE
14 years 9 months ago
A comparison of discrete and continuous output modeling techniques for a pseudo-2D hidden Markov model face recognition system
Face recognition has become an important topic within the field of pattern recognition and computer vision. In this field a number of different approaches to feature extraction, m...
Frank Wallhoff, Stefan Eickeler, Gerhard Rigoll
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 7 months ago
Maximum Bipartite Matching Size And Application to Cuckoo Hashing
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
Josef Kanizo, David Hay, Isaac Keslassy
TIT
2002
129views more  TIT 2002»
13 years 7 months ago
Arbitrary source models and Bayesian codebooks in rate-distortion theory
-- We characterize the best achievable performance of lossy compression algorithms operating on arbitrary random sources, and with respect to general distortion measures. Direct an...
Ioannis Kontoyiannis, Junshan Zhang
COMPGEOM
2010
ACM
14 years 22 days ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
SSPR
2004
Springer
14 years 1 months ago
Optimizing Classification Ensembles via a Genetic Algorithm for a Web-Based Educational System
Classification fusion combines multiple classifications of data into a single classification solution of greater accuracy. Feature extraction aims to reduce the computational cost ...
Behrouz Minaei-Bidgoli, Gerd Kortemeyer, William F...