187 search results - page 15 / 38 » On the Natural Imprint Function of a Graph |
177
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
184
click to vote
WG
2005
Springer
16 years 1 days ago
2005
Springer
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
143
click to vote
FOCS
2003
IEEE
15 years 12 months ago
2003
IEEE
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...
189
click to vote
ICIP
2008
IEEE
16 years 8 months ago
2008
IEEE
In this paper, we present a patch-based variational Bayesian framework of image processing using the language of factor graphs (FGs). The variable and factor nodes of FGs represen...
155
click to vote
SPIRE
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. We introduce a new data structure, called MiGaL for “Multiple Graph Layers”, that is composed of various graphs linked together ions of abstraction/refinement. The n...