1105 search results - page 134 / 221 » Linear choosability of graphs |
137
click to vote
CVPR
1998
IEEE
16 years 6 months ago
1998
IEEE
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we focus on MRF's with two-valued clique potentials, which form a generaliz...
171
click to vote
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
136
click to vote
DCC
2004
IEEE
16 years 4 months ago
2004
IEEE
We study sets of lines of AG(n, q) and PG(n, q) with the property that no three lines form a triangle. As a result the associated point-line incidence graph contains no 6-cycles a...
144
click to vote
ICCAD
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— Retiming, c-slow retiming and recycling are different transformations for the performance optimization of sequential circuits. For retiming and c-slow retiming, differe...
132
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Tetris is a falling block game where the player’s objective is to arrange a sequence of different shaped tetrominoes smoothly in order to survive. In the intelligence games, ag...