Sciweavers

504 search results - page 32 / 101
» Canonical Graph Shapes
Sort
View
ECCV
2002
Springer
14 years 10 months ago
Shock-Based Indexing into Large Shape Databases
This paper examines issues arising in applying a previously developed edit-distance shock graph matching technique to indexing into large shape databases. This approach compares th...
Thomas B. Sebastian, Philip N. Klein, Benjamin B. ...
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
14 years 10 months ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou
HLK
2003
IEEE
14 years 1 months ago
Bayesian Reconstruction of 3D Shapes and Scenes From A Single Image
It’s common experience for human vision to perceive full 3D shape and scene from a single 2D image with the occluded parts “filled-in” by prior visual knowledge. In this pa...
Feng Han, Song Chun Zhu
CIVR
2007
Springer
178views Image Analysis» more  CIVR 2007»
14 years 2 months ago
Layout indexing of trademark images
Ensuring the uniqueness of trademark images and protecting their identities are the most important objectives for the trademark registration process. To prevent trademark infringe...
Reinier H. van Leuken, M. Fatih Demirci, Victoria ...
WOLLIC
2007
Springer
14 years 2 months ago
Hydra Games and Tree Ordinals
Hydra games were introduced by Kirby and Paris, for the formulation of a result which is independent from Peano arithmetic but depends on the transfinite structure of 0. Tree ordi...
Ariya Isihara