1816 search results - page 109 / 364 » A New Approach for Solving the Maximum Clique Problem |
109
click to vote
CAGD
1998
15 years 5 months ago
1998
Five-axis machining of sculptured surfaces is gaining wider acceptance in many industries. This paper examines the potential of a new tool positioning strategy where the desired s...
143
click to vote
WSC
2008
15 years 8 months ago
2008
We introduce a new approach, called Relative Start and Idle Time (RSIT), to solve probabilistic scheduling problems of construction repetitive projects. RSIT is a process of deter...
171
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
206
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
Recently sparse representation has been applied to visual tracker by modeling the target appearance using a sparse approximation over a template set, which leads to the so-called ...
236
Voted
ICCAD
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper, we present an efficient method to solve the obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem optimally. Our work is a major improvement over the w...