Sciweavers

284 search results - page 5 / 57
» Attributed Graph Matching Using Local Descriptions
Sort
View
ISBI
2004
IEEE
15 years 10 months ago
Local Feature Matching Using Entropic Graphs
We present a general framework for image discrimination based on identifying small, localized differences between images. Our novel matching scheme is based on an alternate inform...
Huzefa Neemuchwala, Alfred O. Hero, Paul L. Carson...
93
Voted
APPROX
2004
Springer
179views Algorithms» more  APPROX 2004»
15 years 2 months ago
Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz
MICCAI
2004
Springer
15 years 10 months ago
Image Registration by Hierarchical Matching of Local Spatial Intensity Histograms
We previously presented a HAMMER image registration algorithm that demonstrated high accuracy in superposition of images from different individual brains. However, the HAMMER regis...
Dinggang Shen
ECEASST
2008
95views more  ECEASST 2008»
14 years 9 months ago
Graph Transformations for the Resource Description Framework
: The Resource Description Framework (RDF) is a standard developed by the World Wide Web Consortium (W3C) to facilitate the representation and exchange of structured (meta-)data in...
Benjamin Braatz, Christoph Brandt
PAKDD
1999
ACM
124views Data Mining» more  PAKDD 1999»
15 years 1 months ago
Discovery of Equations and the Shared Operational Semantics in Distributed Autonomous Databases
Empirical equations are an important class of regularities that can be discovered in databases. In this paper we concentrate on the role of equations as de nitions of attribute val...
Zbigniew W. Ras, Jan M. Zytkow