Sciweavers

564 search results - page 32 / 113
» Error-tolerant Tree Matching
Sort
View
ICPR
2010
IEEE
15 years 7 months ago
Constrained Energy Minimization for Matching-Based Image Recognition
We propose to use energy minimization in MRFs for matching-based image recognition tasks. To this end, the Tree-Reweighted Message Passing algorithm is modified by geometric cons...
Tobias Gass, Philippe Dreuw, Hermann Ney
STOC
1993
ACM
109views Algorithms» more  STOC 1993»
15 years 5 months ago
Routing permutations on graphs via matchings
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
Noga Alon, Fan R. K. Chung, Ronald L. Graham
PVLDB
2010
200views more  PVLDB 2010»
14 years 12 months ago
SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
Shijie Zhang, Jiong Yang, Wei Jin
DL
2000
Springer
146views Digital Library» more  DL 2000»
15 years 5 months ago
Document overlap detection system for distributed digital libraries
In this paper we introduce the MatchDetectReveal(MDR) system, which is capable of identifying overlapping and plagiarised documents. Each component of the system is briefly descri...
Krisztián Monostori, Arkady B. Zaslavsky, H...
CORR
2008
Springer
74views Education» more  CORR 2008»
15 years 1 months ago
Biased Range Trees
A data structure, called a biased range tree, is presented that preprocesses a set S of n points in R2 and a query distribution D for 2-sided orthogonal range counting queries. The...
Vida Dujmovic, John Howat, Pat Morin