Sciweavers

4137 search results - page 777 / 828
» On the number of matchings of a tree
Sort
View
CORR
2000
Springer
120views Education» more  CORR 2000»
13 years 7 months ago
Scaling Up Inductive Logic Programming by Learning from Interpretations
When comparing inductive logic programming (ILP) and attribute-value learning techniques, there is a trade-off between expressive power and efficiency. Inductive logic programming ...
Hendrik Blockeel, Luc De Raedt, Nico Jacobs, Bart ...
PVLDB
2008
128views more  PVLDB 2008»
13 years 7 months ago
Implementing filesystems by tree-aware DBMSs
With the rise of XML, the database community has been challenged by semi-structured data processing. Since the data type behind XML is the tree, state-of-the-art RDBMSs have learn...
Alexander Holupirek, Marc H. Scholl
MIDDLEWARE
2010
Springer
13 years 6 months ago
FaReCast: Fast, Reliable Application Layer Multicast for Flash Dissemination
Abstract. To disseminate messages from a single source to a large number of targeted receivers, a natural approach is the tree-based application layer multicast (ALM). However, in ...
Kyungbaek Kim, Sharad Mehrotra, Nalini Venkatasubr...
RCIS
2010
13 years 6 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
TDSC
2010
218views more  TDSC 2010»
13 years 6 months ago
Secure Data Objects Replication in Data Grid
—Secret sharing and erasure coding-based approaches have been used in distributed storage systems to ensure the confidentiality, integrity, and availability of critical informati...
Manghui Tu, Peng Li, I-Ling Yen, Bhavani M. Thurai...