3105 search results - page 202 / 621 » The Path-Packing Structure of Graphs |
161
click to vote
NIPS
2004
15 years 5 months ago
2004
We seek to both detect and segment objects in images. To exploit both local image data as well as contextual information, we introduce Boosted Random Fields (BRFs), which use boos...
163
Voted
TIP
2010
15 years 2 months ago
2010
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
112
Voted
CAIP
2009
Springer
15 years 10 months ago
2009
Springer
Measures of central tendency for graphs are important for protoype construction, frequent substructure mining, and multiple alignment of protein structures. This contribution propo...
166
click to vote
CAI
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we present an overview of algebraic graph transformation in the double pushout approach. Basic results concerning independence, parallelism, concurrency, embedding, ...
132
click to vote
CSL
2005
Springer
15 years 9 months ago
2005
Springer
We show that the modular decomposition of a countable graph can be defined from this graph, given with an enumeration of its set of vertices, by formulas of Monadic Second-Order l...