9572 search results - page 270 / 1915 » Cover Algorithms and Their Combination |
211
click to vote
ISSAC
1997
Springer
1997
Springer
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
15 years 10 months ago
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
220
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
Object localization in an image is usually handled by searching for an optimal subwindow that tightly covers the object of interest. However, the subwindows considered in previous ...
142
click to vote
WADS
2007
Springer
16 years 20 days ago
2007
Springer
We study the presence of obstacles in computing BCP(s, t) (Best Coverage Path between two points s and t) in a 2D field under surveillance by sensors. Consider a set of m line seg...
193
click to vote
MFCS
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
165
click to vote
INFOCOM
2003
IEEE
15 years 12 months ago
2003
IEEE
Abstract – In this paper, we develop failure-resilient techniques for monitoring link delays and faults in a Service Provider or Enterprise IP network. Our two-phased approach at...