12519 search results - page 218 / 2504 » Approximation Problems Categories |
162
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...
148
click to vote
ICCSA
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
227
click to vote
COMBINATORICA
2010
15 years 1 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
141
click to vote
ITICSE
2004
ACM
15 years 12 months ago
2004
ACM
This paper describes a knowledge unit and the use of a software tool, DesignMentor, for teaching a very challenging topic in computer graphics and visualization, namely: curve and...
160
click to vote
SIGECOM
2004
ACM
15 years 12 months ago
2004
ACM
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...