4894 search results - page 672 / 979 » The Guarding Problem - Complexity and Approximation |
145
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
122
Voted
ICTAI
2008
IEEE
15 years 10 months ago
2008
IEEE
These last years, the issue of locating and explaining contradictions inside sets of propositional clauses has received a renewed attention due to the emergence of very efficient...
172
click to vote
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— The problem of non-cooperative power control is studied for wireless ad hoc networks supporting data services. We develop a maximum throughput based non-cooperative power contr...
117
Voted
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract—In wireless networks, monotonic, strictly subhomogeneous functions have been used to analyze power control algorithms. We provide an alternative analysis based on the ob...
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
—Layered streaming is an effective solution to address the receiver heterogeneity in peer-to-peer (P2P) multimedia distribution. This paper targets a fundamental challenge in thi...