Sciweavers

3656 search results - page 277 / 732
» Compact Location Problems
Sort
View
AI
2010
Springer
15 years 6 months ago
Kernel functions for case-based planning
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
Ivan Serina
APPML
2007
154views more  APPML 2007»
15 years 6 months ago
Comparison of distances between measures
The problem of optimal transportation between a set of sources and a set of wells has become recently the object of new mathematical models generalizing the Monge-Kantorovich prob...
Jean-Michel Morel, Filippo Santambrogio
STOC
2004
ACM
118views Algorithms» more  STOC 2004»
16 years 7 months ago
Boosted sampling: approximation algorithms for stochastic optimization
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
WAOA
2004
Springer
107views Algorithms» more  WAOA 2004»
16 years 1 hour ago
Order-Preserving Transformations and Greedy-Like Algorithms
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...
Spyros Angelopoulos
ECCV
2010
Springer
15 years 11 months ago
Efficient Non-Consecutive Feature Tracking for Structure-from-Motion
Abstract. Structure-from-motion (SfM) is an important computer vision problem and largely relies on the quality of feature tracking. In image sequences, if disjointed tracks caused...