Sciweavers

1683 search results - page 132 / 337
» Learning with Mixtures of Trees
Sort
View
TIT
1998
123views more  TIT 1998»
13 years 9 months ago
The Minimum Description Length Principle in Coding and Modeling
—We review the principles of Minimum Description Length and Stochastic Complexity as used in data compression and statistical modeling. Stochastic complexity is formulated as the...
Andrew R. Barron, Jorma Rissanen, Bin Yu
QSIC
2007
IEEE
14 years 3 months ago
Learning Effective Oracle Comparator Combinations for Web Applications
Web application testers need automated, effective approaches to validate the test results of complex, evolving web applications. In previous work, we developed a suite of automate...
Sara Sprenkle, Emily Hill, Lori L. Pollock
CVPR
2007
IEEE
14 years 11 months ago
Learning Visual Similarity Measures for Comparing Never Seen Objects
In this paper we propose and evaluate an algorithm that learns a similarity measure for comparing never seen objects. The measure is learned from pairs of training images labeled ...
Eric Nowak, Frédéric Jurie
ECCV
2008
Springer
14 years 11 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
HEURISTICS
2008
92views more  HEURISTICS 2008»
13 years 9 months ago
Learning heuristics for basic block instruction scheduling
Instruction scheduling is an important step for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction scheduling is to ...
Abid M. Malik, Tyrel Russell, Michael Chase, Peter...