Sciweavers

47 search results - page 6 / 10
» Approximate Constrained Subgraph Matching
Sort
View
CVPR
2007
IEEE
14 years 10 months ago
Optimizing Distribution-based Matching by Random Subsampling
We boost the efficiency and robustness of distributionbased matching by random subsampling which results in the minimum number of samples required to achieve a specified probabili...
Alex Po Leung, Shaogang Gong
TSMC
1998
117views more  TSMC 1998»
13 years 8 months ago
A mean field annealing approach to robust corner detection
—This paper is an extension of our previous paper to improve the capability of detecting corners. We proposed a method of boundary smoothing for curvature estimation using a cons...
Kwanghoon Sohn, Jung H. Kim, Winser E. Alexander
BMCBI
2008
208views more  BMCBI 2008»
13 years 8 months ago
GraphFind: enhancing graph searching by low support data mining techniques
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...
Alfredo Ferro, Rosalba Giugno, Misael Mongiov&igra...
TIP
2008
169views more  TIP 2008»
13 years 8 months ago
Maximum Likelihood Wavelet Density Estimation With Applications to Image and Shape Matching
Density estimation for observational data plays an integral role in a broad spectrum of applications, e.g. statistical data analysis and information-theoretic image registration. ...
Adrian M. Peter, Anand Rangarajan
ALT
2010
Springer
13 years 10 months ago
Inferring Social Networks from Outbreaks
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
Dana Angluin, James Aspnes, Lev Reyzin