3875 search results - page 166 / 775 » Approximation algorithms for the 0-extension problem |
152
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
We consider distributed algorithms to optimize random access multihop wireless networks in the presence of fading. Since the associated optimization problem is neither convex nor ...
125
click to vote
STOC
2005
ACM
16 years 5 months ago
2005
ACM
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
201
Voted
OL
2011
14 years 12 months ago
2011
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
147
click to vote
ICCV
2005
IEEE
16 years 6 months ago
2005
IEEE
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
132
click to vote
UAI
2004
15 years 6 months ago
2004
The paper describes an application of Aggregating Algorithm to the problem of regression. It generalizes earlier results concerned with plain linear regression to kernel technique...