Sciweavers

599 search results - page 90 / 120
» Online learning by ellipsoid method
Sort
View
ACL
2001
13 years 10 months ago
Scaling to Very Very Large Corpora for Natural Language Disambiguation
The amount of readily available on-line text has reached hundreds of billions of words and continues to grow. Yet for most core natural language tasks, algorithms continue to be o...
Michele Banko, Eric Brill
NIPS
2004
13 years 10 months ago
Mistake Bounds for Maximum Entropy Discrimination
We establish a mistake bound for an ensemble method for classification based on maximizing the entropy of voting weights subject to margin constraints. The bound is the same as a ...
Philip M. Long, Xinyu Wu
JAIR
2006
102views more  JAIR 2006»
13 years 8 months ago
Multiple-Goal Heuristic Search
This paper presents a new framework for anytime heuristic search where the task is to achieve as many goals as possible within the allocated resources. We show the inadequacy of t...
Dmitry Davidov, Shaul Markovitch
ICIP
2008
IEEE
14 years 3 months ago
Level set tracking with dynamical shape priors
Dynamical shape priors are curical for level set-based nonrigid object tracking with noise, occlusions or background clutter. In this paper, we propose a level set tracking framew...
Xue Zhou, Xi Li, Weiming Hu
SIGIR
2008
ACM
13 years 8 months ago
Query dependent ranking using K-nearest neighbor
Many ranking models have been proposed in information retrieval, and recently machine learning techniques have also been applied to ranking model construction. Most of the existin...
Xiubo Geng, Tie-Yan Liu, Tao Qin, Andrew Arnold, H...