Sciweavers

263 search results - page 18 / 53
» Path partitions of hypercubes
Sort
View
ICDE
2004
IEEE
90views Database» more  ICDE 2004»
14 years 9 months ago
Multiresolution Indexing of XML for Frequent Queries
XML and other types of semi-structured data are typically represented by a labeled directed graph. To speed up path expression queries over the graph, a variety of structural inde...
Hao He, Jun Yang 0001
PAMI
2008
195views more  PAMI 2008»
13 years 8 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
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
13 years 9 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 8 months ago
Optimal Scheduling of File Transfers with Divisible Sizes on Multiple Disjoint Paths
In this paper I investigate several offline and online data transfer scheduling problems and propose efficient algorithms and techniques for addressing them. In the offline case, ...
Mugurel Ionut Andreica
ISMIS
2011
Springer
12 years 11 months ago
Data Access Paths in Processing of Sets of Frequent Itemset Queries
Abstract. Frequent itemset mining can be regarded as advanced database querying where a user specifies the dataset to be mined and constraints to be satisfied by the discovered i...
Piotr Jedrzejczak, Marek Wojciechowski