Sciweavers

373 search results - page 36 / 75
» Counting in Trees for Free
Sort
View
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 8 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
KDD
2005
ACM
104views Data Mining» more  KDD 2005»
14 years 9 months ago
Mining tree queries in a graph
We present an algorithm for mining tree-shaped patterns in a large graph. Novel about our class of patterns is that they can contain constants, and can contain existential nodes w...
Bart Goethals, Eveline Hoekx, Jan Van den Bussche
DAWAK
2004
Springer
14 years 2 months ago
A Tree Partitioning Method for Memory Management in Association Rule Mining
All methods of association rule mining require the frequent sets of items, that occur together sufficiently often to be the basis of potentially interesting rules, to be first com...
Shakil Ahmed, Frans Coenen, Paul H. Leng
COLING
1996
13 years 10 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
PIMRC
2008
IEEE
14 years 3 months ago
Understanding the Performance of 802.11 Networks
Abstract—In this paper, we review the most important performance characteristics of the 802.11 DCF wireless networks, point out some false common knowledge, and report on recent ...
Andrzej Duda