253 search results - page 10 / 51 » Searching optimal feature subset using mutual information |
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
PAKDD
2010
ACM
13 years 11 months ago
2010
ACM
We present a general framework for the task of extracting specific information “on demand” from a large corpus such as the Web under resource-constraints. Given a database wit...
ACCV
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Intensity based registration methods, such as the mutual information (MI), do not commonly consider the spatial geometric information and the initial correspondences are ...
CEC
2008
IEEE
14 years 1 months ago
2008
IEEE
—This paper presents an eavesdropper-proof algorithm that is capable of fast generating symmetric (secret) keys. Instead of literally exchanging secret keys, both the sender and ...
ICPR
2008
IEEE
14 years 1 months ago
2008
IEEE
We propose new Continuous Hidden Markov Model (CHMM) structure that integrates feature weighting component. We assume that each feature vector could include different subsets of f...