Sciweavers

1056 search results - page 58 / 212
» Constraint-Based Graph Matching
Sort
View
CIVR
2007
Springer
14 years 3 months ago
Comparison of face matching techniques under pose variation
The ability to match faces in video is a crucial component for many multimedia applications such as searching and recognizing people in semantic video browsing, surveillance and h...
Bart Kroon, Alan Hanjalic, Sabri Boughorbel
DAM
2011
13 years 4 months ago
Matchability and k-maximal matchings
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen...
PKDD
2005
Springer
155views Data Mining» more  PKDD 2005»
14 years 2 months ago
Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication
How can we generate realistic graphs? In addition, how can we do so with a mathematically tractable model that makes it feasible to analyze their properties rigorously? Real graphs...
Jure Leskovec, Deepayan Chakrabarti, Jon M. Kleinb...
ICDE
2007
IEEE
167views Database» more  ICDE 2007»
14 years 10 months ago
GString: A Novel Approach for Efficient Search in Graph Databases
Graphs are widely used for modeling complicated data, including chemical compounds, protein interactions, XML documents, and multimedia. Information retrieval against such data ca...
Haoliang Jiang, Haixun Wang, Philip S. Yu, Shuigen...
MFCS
2004
Springer
14 years 2 months ago
The Bidimensional Theory of Bounded-Genus Graphs
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitr...