Sciweavers

95 search results - page 13 / 19
» Top-k subgraph matching query in a large graph
Sort
View
ESCIENCE
2007
IEEE
13 years 11 months ago
A Scalable and Efficient Prefix-Based Lookup Mechanism for Large-Scale Grids
Data sources, storage, computing resources and services are entities on Grids that require mechanisms for publication and lookup. A discovery service relies on efficient lookup to...
Philip Chan, David Abramson
CIVR
2007
Springer
178views Image Analysis» more  CIVR 2007»
14 years 1 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 ...
BMCBI
2008
119views more  BMCBI 2008»
13 years 7 months ago
A new method for 2D gel spot alignment: application to the analysis of large sample sets in clinical proteomics
Background: In current comparative proteomics studies, the large number of images generated by 2D gels is currently compared using spot matching algorithms. Unfortunately, differe...
Sabine Pérès, Laurence Molina, Nicol...
AC
2000
Springer
13 years 12 months ago
Graph-Theoretical Methods in Computer Vision
The management of large databases of hierarchical (e.g., multi-scale or multilevel) image features is a common problem in object recognition. Such structures are often represented ...
Ali Shokoufandeh, Sven J. Dickinson
ECCV
2002
Springer
14 years 9 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. ...