2957 search results - page 32 / 592 » The Complexity of Polynomial-Time Approximation |
131
click to vote
SIGECOM
2006
ACM
15 years 10 months ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
156
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper presents a novel graph cut based segmentation approach with shape priors. The model incorporates statistical shape prior information with the active contour without edg...
129
click to vote
CIS
2004
Springer
15 years 9 months ago
2004
Springer
For finding accurate and biologically meaningful multiple sequence alignment, it is required to consider a loosely constrained version of multiple sequence alignment. This paper is...
120
click to vote
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
143
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...