2957 search results - page 179 / 592 » The Complexity of Polynomial-Time Approximation |
155
click to vote
PAMI
2006
15 years 6 months ago
2006
This study investigates a level set method for complex polarimetric image segmentation. It consists of minimizing a functional containing an original observation term derived from ...
168
click to vote
PODC
2009
ACM
16 years 6 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
234
click to vote
RECOMB
2004
Springer
16 years 6 months ago
2004
Springer
Abstract. In this study we propose a novel model for the representation of biological networks and provide algorithms for learning model parameters from experimental data. Our appr...
273
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
161
Voted
APPROX
2009
Springer
16 years 22 days ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...