Sciweavers

385 search results - page 66 / 77
» On higher-order perceptron algorithms
Sort
View
NIPS
2007
13 years 11 months ago
Structured Learning with Approximate Inference
In many structured prediction problems, the highest-scoring labeling is hard to compute exactly, leading to the use of approximate inference methods. However, when inference is us...
Alex Kulesza, Fernando Pereira
IPPS
2010
IEEE
13 years 7 months ago
Large neighborhood local search optimization on graphics processing units
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
ICIP
2008
IEEE
14 years 11 months ago
Supervised image segmentation via ground truth decomposition
This paper proposes a data driven image segmentation algorithm, based on decomposing the target output (ground truth). Classical pixel labeling methods utilize machine learning al...
Ilya Levner, Russell Greiner, Hong Zhang
CVPR
2010
IEEE
14 years 3 months ago
Learning 3D Action Models from a few 2D videos for View Invariant Action Recognition
Most existing approaches for learning action models work by extracting suitable low-level features and then training appropriate classifiers. Such approaches require large amount...
Pradeep Natarajan, Vivek Singh, Ram Nevatia
KDD
1998
ACM
113views Data Mining» more  KDD 1998»
14 years 1 months ago
Targeting Business Users with Decision Table Classifiers
Business users and analysts commonly use spreadsheets and 2D plots to analyze and understand their data. On-line Analytical Processing (OLAP) provides these users with added flexi...
Ron Kohavi, Dan Sommerfield