1486 search results - page 178 / 298 » Algorithms for two-box covering |
117
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
109
click to vote
ICMCS
2006
IEEE
15 years 10 months ago
2006
IEEE
Removal of rain streaks in video is a challenging problem due to the random spatial distribution and fast motion of rain. This paper presents a new rain removal algorithm that inc...
146
click to vote
JSAI
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. This paper is concerned with algorithms for the logical generalisation of probabilistic temporal models from examples. The algorithms combine logic and probabilistic mode...
122
click to vote
LPAR
2005
Springer
15 years 10 months ago
2005
Springer
We present an algorithm for the conversion of very weak alternating Büchi automata into nondeterministic Büchi automata (NBA), and we introduce a local optimization criterion fo...
132
click to vote
APPROX
2004
Springer
15 years 10 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...