Sciweavers

2695 search results - page 119 / 539
» Learning Graph Matching
Sort
View
151
Voted
ICCV
2011
IEEE
14 years 2 months ago
Robust Topological Features for Deformation Invariant Image Matching
Local photometric descriptors are a crucial low level component of numerous computer vision algorithms. In practice, these descriptors are constructed to be invariant to a class o...
Edgar Lobaton, Ramanarayan Vasudevan, Ron Alterovi...
129
Voted
ECAI
2000
Springer
15 years 7 months ago
Background Knowledge, Indexing and Matching Interdependencies of Document Management and Ontology-Maintenance
This position paper presents an algorithm, which determines similarities between text documents. These text documents are indexed with keywords and further background knowledge-ter...
Andreas Faatz, Thomas Kamps, Ralf Steinmetz
126
Voted
ACL
2010
15 years 19 days ago
Global Learning of Focused Entailment Graphs
We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed ed...
Jonathan Berant, Ido Dagan, Jacob Goldberger
DC
2010
15 years 2 months ago
An optimal maximal independent set algorithm for bounded-independence graphs
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
Johannes Schneider, Roger Wattenhofer
149
Voted
JGAA
2007
135views more  JGAA 2007»
15 years 2 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento