3169 search results - page 166 / 634 » Robust Timed Automata |
132
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Tracking multiple objects under occlusion is one of the most challenging issues in computer vision. Occlusion results in mistaken match when finding the most similar candidate. A...
159
Voted
ICCAD
2006
IEEE
16 years 14 days ago
2006
IEEE
— This paper presents a robust quadratic placement approach, which offers both high-quality placements and excellent computational efficiency. The additional force which distrib...
104
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
This research uses a Design of Experiments (DOE) approach to build a predictive model of the performance of a combinatorial optimization heuristic over a range of heuristic tuning...
167
click to vote
SWAT
2010
Springer
15 years 8 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
127
Voted
ICIP
1998
IEEE
16 years 5 months ago
1998
IEEE
We present an algorithm that efficiently tracks a predefined set of landmark points in a time sequence of images. The algorithm iteratively optimizes the correspondences between t...