Sciweavers

1290 search results - page 186 / 258
» Popular Matchings: Structure and Algorithms
Sort
View
CVPR
2007
IEEE
16 years 8 months ago
Simultaneous Covariance Driven Correspondence (CDC) and Transformation Estimation in the Expectation Maximization Framework
This paper proposes a new registration algorithm, Covariance Driven Correspondences (CDC), that depends fundamentally on the estimation of uncertainty in point correspondences. Th...
Michal Sofka, Gehua Yang, Charles V. Stewart
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
16 years 6 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
CIKM
2009
Springer
16 years 26 days ago
Learning to rank graphs for online similar graph search
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
NBIS
2007
Springer
16 years 12 days ago
Implementing Range Queries with a Decentralized Balanced Tree over Distributed Hash Tables
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...
Nuno Lopes, Carlos Baquero
COCOON
2001
Springer
15 years 10 months ago
PC-Trees vs. PQ-Trees
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent par...
Wen-Lian Hsu