Sciweavers

7913 search results - page 182 / 1583
» Information Collection on a Graph
Sort
View
CAIP
2009
Springer
210views Image Analysis» more  CAIP 2009»
14 years 2 months ago
Shape Classification Using a Flexible Graph Kernel
The medial axis being an homotopic transformation, the skeleton of a 2D shape corresponds to a planar graph having one face for each hole of the shape and one node for each junctio...
François-Xavier Dupé, Luc Brun
VLDB
2012
ACM
361views Database» more  VLDB 2012»
12 years 5 months ago
Answering pattern match queries in large graph databases via graph embedding
The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest path query, reachability verification, and pattern ...
Lei Zou, Lei Chen 0002, M. Tamer Özsu, Dongya...
CIKM
2001
Springer
14 years 2 months ago
The Effectiveness of Query Expansion for Distributed Information Retrieval
Query expansion has been shown effective for both single database retrieval and for distributed information retrieval where complete collection information is available. One might...
Paul Ogilvie, James P. Callan
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
14 years 11 days ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
CIKM
2008
Springer
14 years 10 days ago
Retrievability: an evaluation measure for higher order information access tasks
Evaluation in Information Retrieval (IR) has long focused on effectiveness and efficiency. However, new and emerging access tasks now demand alternative evaluation measures which ...
Leif Azzopardi, Vishwa Vinay