Sciweavers

421 search results - page 33 / 85
» Exact and Heuristic Algorithms for the Weapon-Target Assignm...
Sort
View
IVC
2007
114views more  IVC 2007»
13 years 7 months ago
Evaluation of a convex relaxation to a quadratic assignment matching approach for relational object views
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
Christian Schellewald, Stefan Roth, Christoph Schn...
CVPR
2012
IEEE
11 years 10 months ago
Active image clustering: Seeking constraints from humans to complement algorithms
We propose a method of clustering images that combines algorithmic and human input. An algorithm provides us with pairwise image similarities. We then actively obtain selected, mo...
Arijit Biswas, David W. Jacobs
ANOR
2005
120views more  ANOR 2005»
13 years 7 months ago
Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...
Krishna Chepuri, Tito Homem-de-Mello
CVPR
2012
IEEE
11 years 10 months ago
Multitarget data association with higher-order motion models
We present an iterative approximate solution to the multidimensional assignment problem under general cost functions. The method maintains a feasible solution at every step, and i...
Robert T. Collins
ICCAD
2005
IEEE
108views Hardware» more  ICCAD 2005»
14 years 4 months ago
A routing algorithm for flip-chip design
— The flip-chip package gives the highest chip density of any packaging method to support the pad-limited Application-Specific Integrated Circuit (ASIC) designs. In this paper,...
Jia-Wei Fang, I-Jye Lin, Ping-Hung Yuh, Yao-Wen Ch...