3265 search results - page 165 / 653 » Representing Groups on Graphs |
118
Voted
WEA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
146
click to vote
COCOON
2003
Springer
15 years 9 months ago
2003
Springer
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...
124
click to vote
CVIU
2006
15 years 4 months ago
2006
We present a framework for categorical shape recognition. The coarse shape of an object is captured by a multiscale blob decomposition, representing the compact and elongated part...
129
Voted
JEC
2006
15 years 4 months ago
2006
Many applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). In our previous work, we proposed a ...
129
click to vote
DATE
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...