The refereed proceedings of the 4th IAPR International Workshop on Graph-Based Representation in Pattern Recognition, GbRPR 2003, held in York, UK in June/July 2003. The 23 revised full papers presented were carefully reviewed and selected for inclusion in the book. The papers are organized in topical sections on data structures and representation, segmentation, graph edit distance, graph matching, matrix methods, and graph clustering.
FREE Two-Day Shipping for students on millions of items. Learn more |
Book Description
Product Details
Would you like to update product info or give feedback on images?
|
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
Key Phrases - Statistically Improbable Phrases (SIPs):
(learn more)
median graph candidate, generalized median graph, bounded valence graphs, new graph polynomial, interlace polynomial, graph edit distance, maximal independent vertex set, unique node labels, contraction kernel, randomly connected graphs, common supergraph, surviving vertices, graph pyramids, edit lattice, graduated assignment algorithm, graph matching scheme, maximum common subgraph, mve estimator, gain graphs, spectral feature vectors, brute force matching, function assigning labels, winner map, combinatorial map, surviving vertex Key Phrases - Capitalized Phrases (CAPs): (learn more)
Computer Science, Springer-Verlag Berlin Heidelberg, Graph-based Representations, Image Processing, Lecture Notes, Combinatorial Pyramids, New York, International Conference, Ullmann Algorithm, University of Bern, World Scientific, Pattern Anal, Handbook of Combinatorial Optimization, Informatica Universitą, International Workshop, Introduction Graphs, Machine Intell, Neural Computation, Springer Verlag, Venezia Mestre, Vienna University of Technology, Constrained Kronecker Match Matrix, Osterreichische Computer Gesellschaft, State Space Representation, Venezia Via Torino New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
median graph candidate, generalized median graph, bounded valence graphs, new graph polynomial, interlace polynomial, graph edit distance, maximal independent vertex set, unique node labels, contraction kernel, randomly connected graphs, common supergraph, surviving vertices, graph pyramids, edit lattice, graduated assignment algorithm, graph matching scheme, maximum common subgraph, mve estimator, gain graphs, spectral feature vectors, brute force matching, function assigning labels, winner map, combinatorial map, surviving vertex Key Phrases - Capitalized Phrases (CAPs): (learn more)
Computer Science, Springer-Verlag Berlin Heidelberg, Graph-based Representations, Image Processing, Lecture Notes, Combinatorial Pyramids, New York, International Conference, Ullmann Algorithm, University of Bern, World Scientific, Pattern Anal, Handbook of Combinatorial Optimization, Informatica Universitą, International Workshop, Introduction Graphs, Machine Intell, Neural Computation, Springer Verlag, Venezia Mestre, Vienna University of Technology, Constrained Kronecker Match Matrix, Osterreichische Computer Gesellschaft, State Space Representation, Venezia Via Torino New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Books on Related Topics
(learn more)
|
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
