1952 search results - page 299 / 391 » Complete partitions of graphs |
192
click to vote
CADE
2007
Springer
16 years 6 months ago
2007
Springer
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
144
click to vote
ICCAD
2005
IEEE
16 years 3 months ago
2005
IEEE
Clustering (or partitioning) is a crucial step between logic synthesis and physical design in the layout of a large scale design. A design verified at the logic synthesis level m...
150
click to vote
IUI
2009
ACM
16 years 3 months ago
2009
ACM
Concept maps are an important tool to knowledge organization, representation, and sharing. Most current concept map tools do not provide full support for hand-drawn concept map cr...
150
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Graph-cuts optimization is prevalent in vision and graphics problems. It is thus of great practical importance to parallelize the graph-cuts optimization using today’s ubiquitou...
162
click to vote
CVPR
2010
IEEE
16 years 1 months ago
2010
IEEE
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...