Sciweavers

1594 search results - page 50 / 319
» Fast Prediction on a Tree
Sort
View
COLT
2001
Springer
14 years 14 days ago
Learning Additive Models Online with Fast Evaluating Kernels
Abstract. We develop three new techniques to build on the recent advances in online learning with kernels. First, we show that an exponential speed-up in prediction time per trial ...
Mark Herbster
SIGMOD
1999
ACM
122views Database» more  SIGMOD 1999»
14 years 8 days ago
BOAT-Optimistic Decision Tree Construction
Classification is an important data mining problem. Given a training database of records, each tagged with a class label, the goal of classification is to build a concise model ...
Johannes Gehrke, Venkatesh Ganti, Raghu Ramakrishn...
ECCV
2008
Springer
14 years 9 months ago
Keypoint Signatures for Fast Learning and Recognition
Abstract. Statistical learning techniques have been used to dramatically speed-up keypoint matching by training a classifier to recognize a specific set of keypoints. However, the ...
Michael Calonder, Vincent Lepetit, Pascal Fua
INFOCOM
2007
IEEE
14 years 2 months ago
Pipelined van Emde Boas Tree: Algorithms, Analysis, and Applications
Abstract— Priority queues are essential for various network processing applications, including per-flow queueing with Quality-of-Service (QoS) guarantees, management of large fa...
Hao Wang, Bill Lin
CVPR
2010
IEEE
14 years 4 months ago
Fast Globally Optimal 2D Human Detection with Loopy Graph Models
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
Tai-Peng Tian, Stan Sclaroff