Sciweavers

812 search results - page 68 / 163
» Preference-based learning to rank
Sort
View
CVPR
2004
IEEE
16 years 2 months ago
BoostMap: A Method for Efficient Approximate Similarity Rankings
This paper introduces BoostMap, a method that can significantly reduce retrieval time in image and video database systems that employ computationally expensive distance measures, ...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...
JSS
2010
198views more  JSS 2010»
14 years 7 months ago
Accelerated collection of sensor data by mobility-enabled topology ranks
We study the problem of fast and energy-efficient data collection of sensory data using a mobile sink, in wireless sensor networks in which both the sensors and the sink move. Mot...
Constantinos Marios Angelopoulos, Sotiris E. Nikol...
106
Voted
ICASSP
2009
IEEE
15 years 4 months ago
Improved lattice-based spoken document retrieval by directly learning from the evaluation measures
Lattice-based approaches have been widely used in spoken document retrieval to handle the speech recognition uncertainty and errors. Position Specific Posterior Lattices (PSPL) an...
Chao-hong Meng, Hung-yi Lee, Lin-shan Lee
126
Voted
ICANN
2009
Springer
14 years 10 months ago
MINLIP: Efficient Learning of Transformation Models
Abstract. This paper studies a risk minimization approach to estimate a transformation model from noisy observations. It is argued that transformation models are a natural candidat...
Vanya Van Belle, Kristiaan Pelckmans, Johan A. K. ...
ICML
2006
IEEE
16 years 1 months ago
Full Bayesian network classifiers
The structure of a Bayesian network (BN) encodes variable independence. Learning the structure of a BN, however, is typically of high computational complexity. In this paper, we e...
Jiang Su, Harry Zhang