Sciweavers

2219 search results - page 306 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
CVPR
2012
IEEE
13 years 5 months ago
Scale resilient, rotation invariant articulated object matching
A novel method is proposed for matching articulated objects in cluttered videos. The method needs only a single exemplar image of the target object. Instead of using a small set o...
Hao Jiang, Tai-Peng Tian, Kun He, Stan Sclaroff
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 3 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
ICECCS
1998
IEEE
123views Hardware» more  ICECCS 1998»
15 years 7 months ago
Applying Slicing Technique to Software Architectures
Software architecture is receiving increasingly attention as a critical design level for software systems. As software architecture design resources (in the form of architectural ...
Jianjun Zhao
JCO
1998
136views more  JCO 1998»
15 years 2 months ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...
EUROPAR
2010
Springer
15 years 4 months ago
Hierarchical Work-Stealing
Abstract. We study the problem of dynamic load-balancing on hierarchical platforms. In particular, we consider applications involving heavy communications on a distributed platform...
Jean-Noël Quintin, Frédéric Wag...