779 search results - page 87 / 156 » A graph polynomial for independent sets of bipartite graphs |
CPAIOR
2004
Springer
15 years 3 months ago
2004
Springer
This paper shows that existing definitions of costs associated with soft global constraints are not sufficient to deal with all the usual global constraints. We propose more expre...
DAWAK
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Many real world applications rely on the discovery of maximal biclique subgraphs (complete bipartite subgraphs). However, existing algorithms for enumerating maximal bicl...
JCT
2010
14 years 8 months ago
2010
The pattern-avoiding fillings of Young diagrams we study arose from Postnikov’s work on positive Grassman cells. They are called Γ -diagrams, and are in bijection with decorate...
130
click to vote
GPC
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Large-scale distributed computing applications require concurrent programming models that support modular and compositional software development. The actor model supports...
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
We present an automatic method that establishes 3D correspondence between isometric shapes. Our goal is to find an optimal correspondence between two given (nearly) isometric sha...