10608 search results - page 409 / 2122 » Complexity of O'Hara's Algorithm |
146
click to vote
SIAMCOMP
2008
15 years 4 months ago
2008
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
158
click to vote
COMCOM
1998
15 years 4 months ago
1998
With the proliferation of multimedia group applications, the construction of multicast trees satisfying Quality of Service QoS requirements is becoming a problem of prime import...
168
click to vote
MST
2002
15 years 4 months ago
2002
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
135
click to vote
SCP
1998
15 years 4 months ago
1998
Consistency techniques are an e cient way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been designed such as the time...
143
click to vote
CCP
2011
14 years 4 months ago
2011
This project will involve analysing some of the newer fast algorithms in comparison with an exhaustive full search algorithm for motion estimation in video encoders. It will invest...