206 search results - page 21 / 42 » Learning Heuristic Functions from Relaxed Plans |
PAMI
2011
14 years 4 months ago
2011
—We propose a convex formulation for silhouette and stereo fusion in 3D reconstruction from multiple images. The key idea is to show that the reconstruction problem can be cast a...
SIGIR
2008
ACM
14 years 9 months ago
2008
ACM
It is difficult to apply machine learning to new domains because often we lack labeled problem instances. In this paper, we provide a solution to this problem that leverages domai...
112
click to vote
ISMIR
2004
Springer
15 years 3 months ago
2004
Springer
High-Level music descriptors are key ingredients for music information retrieval systems. Although there is a long tradition in extracting information from acoustic signals, the f...
121
click to vote
ISPD
1997
ACM
15 years 2 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
DATE
2007
IEEE
15 years 4 months ago
2007
IEEE
We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders decomposition, our techniq...