4894 search results - page 338 / 979 » The Guarding Problem - Complexity and Approximation |
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...
197
click to vote
SIAMJO
2008
15 years 6 months ago
2008
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
180
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
188
click to vote
INFOCOM
2003
IEEE
15 years 12 months ago
2003
IEEE
— In all-optical networks that use WDM technology it is often the case that several communication requests have to be blocked, due to bandwidth and technology limitations. Minimi...
169
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Given five motion vectors observed in a calibrated camera, what is the rotational and translational velocity of the camera? This problem is the infinitesimal motion analogue to th...