Sciweavers

476 search results - page 73 / 96
» Learning When to Use Lazy Learning in Constraint Solving
Sort
View
PLDI
2004
ACM
15 years 3 months ago
Inducing heuristics to decide whether to schedule
Instruction scheduling is a compiler optimization that can improve program speed, sometimes by 10% or more—but it can also be expensive. Furthermore, time spent optimizing is mo...
John Cavazos, J. Eliot B. Moss
CVPR
2012
IEEE
13 years 3 days ago
The Shape Boltzmann Machine: A strong model of object shape
A good model of object shape is essential in applications such as segmentation, object detection, inpainting and graphics. For example, when performing segmentation, local constra...
S. M. Ali Eslami, Nicolas Heess, John M. Winn
IVA
2010
Springer
14 years 8 months ago
Interactive Motion Modeling and Parameterization by Direct Demonstration
Abstract. While interactive virtual humans are becoming widely used in education, training and therapeutic applications, building animations which are both realistic and parameteri...
Carlo Camporesi, Yazhou Huang, Marcelo Kallmann
CPAIOR
2008
Springer
14 years 11 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
WWW
2009
ACM
15 years 10 months ago
Adaptive bidding for display advertising
Motivated by the emergence of auction-based marketplaces for display ads such as the Right Media Exchange, we study the design of a bidding agent that implements a display adverti...
Arpita Ghosh, Benjamin I. P. Rubinstein, Sergei Va...