1284 search results - page 39 / 257 » Data Structures for Mergeable Trees |
147
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
In this paper we propose a new wavelet transform applicable to functions defined on graphs, high dimensional data and networks. The proposed method generalizes the Haar-like transf...
127
click to vote
ICDM
2002
IEEE
15 years 7 months ago
2002
IEEE
In this paper, we propose a new framework for mining frequent patterns from large transactional databases. The core of the framework is of a novel coded prefix-path tree with two...
126
click to vote
SEMWEB
2010
Springer
15 years 12 days ago
2010
Springer
Abstract. In order to effectively and quickly answer queries in environments with distributed RDF/OWL, we present a query optimization algorithm to identify the potentially relevan...
100
Voted
SPIRE
2005
Springer
15 years 8 months ago
2005
Springer
Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + ℓ) time, where t(n) is the cost ...
117
Voted
NIPS
2003
15 years 3 months ago
2003
This paper devises a novel kernel function for structured natural language data. In the field of Natural Language Processing, feature extraction consists of the following two ste...