Sciweavers

768 search results - page 35 / 154
» Efficient Correlation Search from Graph Databases
Sort
View
CORR
2010
Springer
114views Education» more  CORR 2010»
15 years 1 months ago
Efficiently Discovering Hammock Paths from Induced Similarity Networks
ty networks are important abstractions in many information management applications such as recommender systems, corpora analysis, and medical informatics. For instance, in a recom...
M. Shahriar Hossain, Michael Narayan, Naren Ramakr...
CVPR
2004
IEEE
16 years 4 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell
BMCBI
2007
177views more  BMCBI 2007»
15 years 2 months ago
The BioPrompt-box: an ontology-based clustering tool for searching in biological databases
Background: High-throughput molecular biology provides new data at an incredible rate, so that the increase in the size of biological databanks is enormous and very rapid. This sc...
Claudio Corsi, Paolo Ferragina, Roberto Marangoni
ICDE
2005
IEEE
111views Database» more  ICDE 2005»
16 years 4 months ago
Online Latent Variable Detection in Sensor Networks
Sensor networks attract increasing interest, for a broad range of applications. Given a sensor network, one key issue becomes how to utilize it efficiently and effectively. In par...
Jimeng Sun, Spiros Papadimitriou, Christos Falouts...
ICPR
2002
IEEE
16 years 4 months ago
A New Algorithm for Inexact Graph Matching
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
Adel Hlaoui, Shengrui Wang