757 search results - page 61 / 152 » On the hardness of approximating Max-Satisfy |
APPROX
2008
Springer
14 years 12 months ago
2008
Springer
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
INFOCOM
2012
IEEE
13 years 10 days ago
2012
IEEE
—In this paper, we tackle the spectrum allocation problem in cognitive radio (CR) networks with time-frequency flexibility consideration using combinatorial auction. Different f...
167
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
Current approaches for answering queries with imprecise constraints require user-specific distance metrics and importance measures for attributes of interest - metrics that are ha...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
It has been shown that the 3D shape of a deformable surface in an image can be recovered by establishing correspondences between that image and a reference one in which the shape ...