1105 search results - page 87 / 221 » Linear choosability of graphs |
147
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
134
click to vote
ISCAS
2005
IEEE
15 years 10 months ago
2005
IEEE
— This paper introduces a heuristic solution to the multiple restricted multiplication (MRM) optimization problem. MRM refers to a situation where a single variable is multiplied...
188
click to vote
COCOON
2010
Springer
15 years 3 months ago
2010
Springer
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
167
click to vote
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
This paper addresses recognition of human activities with stochastic structure, characterized by variable spacetime arrangements of primitive actions, and conducted by a variable ...
142
click to vote
CAP
2010
14 years 11 months ago
2010
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...