534 search results - page 79 / 107 » Tight approximation algorithm for connectivity augmentation ... |
APGV
2010
ACM
13 years 11 months ago
2010
ACM
In this paper we explore the ability of the human visual system to detect inconsistencies in the illumination of objects in images. We specifically focus on objects being lit fro...
MP
2007
13 years 7 months ago
2007
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...
STOC
1996
ACM
13 years 11 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...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
SECON
2010
IEEE
13 years 5 months ago
2010
IEEE
Nodes in a cognitive radio mesh network may select from a set of available channels to use provided they do not interfere with primary users. This ability can improve overall netwo...