Sciweavers

2294 search results - page 37 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
ESA
2011
Springer
231views Algorithms» more  ESA 2011»
13 years 9 months ago
Distribution-Aware Compressed Full-Text Indexes
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
Paolo Ferragina, Jouni Sirén, Rossano Ventu...
CORR
2010
Springer
168views Education» more  CORR 2010»
14 years 9 months ago
Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs
The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...
Eric Sopena
PAMI
2008
195views more  PAMI 2008»
14 years 9 months ago
Path Similarity Skeleton Graph Matching
This paper proposes a novel graph matching algorithm and applies it to shape recognition based on object silhouettes. The main idea is to match skeleton graphs by comparing the geo...
Xiang Bai, Longin Jan Latecki
FQAS
2009
Springer
127views Database» more  FQAS 2009»
15 years 4 months ago
Finding Top-k Approximate Answers to Path Queries
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
72
Voted
ICDM
2005
IEEE
142views Data Mining» more  ICDM 2005»
15 years 3 months ago
Shortest-Path Kernels on Graphs
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available b...
Karsten M. Borgwardt, Hans-Peter Kriegel