Sciweavers

909 search results - page 9 / 182
» Performance Evaluation of the VF Graph Matching Algorithm
Sort
View
ASUNAM
2011
IEEE
12 years 7 months ago
Probabilistic Subgraph Matching on Huge Social Networks
—Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the dat...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...
CVPR
2009
IEEE
15 years 2 months ago
Unsupervised Learning for Graph Matching
Graph matching is an important problem in computer vision. It is used in 2D and 3D object matching and recognition. Despite its importance, there is little literature on learnin...
Marius Leordeanu, Martial Hebert
ICDE
2002
IEEE
146views Database» more  ICDE 2002»
14 years 8 months ago
Data Mining Meets Performance Evaluation: Fast Algorithms for Modeling Bursty Traffic
Network, web, and disk I/O traffic are usually bursty, self-similar [9, 3, 5, 6] and therefore can not be modeled adequately with Poisson arrivals[9]. However, we do want to model...
Mengzhi Wang, Ngai Hang Chan, Spiros Papadimitriou...
SIMVIS
2004
13 years 8 months ago
3D Shape Matching Using Skeleton Graphs
We describe a method to match 3D polygonal geometry models using their internal skeleton graphs. These graphs carry information about the overall shape of the model. In order to m...
Angela Brennecke, Tobias Isenberg
ICIAP
2003
ACM
14 years 18 days ago
Color matching by using tuple matching
In this paper we present a new matching method called Tuple Matching (TM), which is an algorithm for matching of signatures. Since signatures can contain arbitrary features like c...
Dirk Balthasar