Sciweavers

4137 search results - page 47 / 828
» On the number of matchings of a tree
Sort
View
FUN
2007
Springer
91views Algorithms» more  FUN 2007»
14 years 1 months ago
High Spies (or How to Win a Programming Contest)
We analyse transports between leaves in an edge-weighted tree. We prove under which conditions there exists a transport matching the weights of a given tree. We use this to compute...
André H. Deutz, Rudy van Vliet, Hendrik Jan...
ALT
2003
Springer
13 years 11 months ago
Efficient Learning of Ordered and Unordered Tree Patterns with Contractible Variables
Due to the rapid growth of tree structured data such as Web documents, efficient learning from tree structured data becomes more and more important. In order to represent structura...
Yusuke Suzuki, Takayoshi Shoudai, Satoshi Matsumot...
SSDBM
2002
IEEE
122views Database» more  SSDBM 2002»
14 years 19 days ago
ATreeGrep: Approximate Searching in Unordered Trees
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
Dennis Shasha, Jason Tsong-Li Wang, Huiyuan Shan, ...
GFKL
2005
Springer
142views Data Mining» more  GFKL 2005»
14 years 1 months ago
Near Similarity Search and Plagiarism Analysis
Abstract. Existing methods to text plagiarism analysis mainly base on “chunking”, a process of grouping a text into meaningful units each of which gets encoded by an integer nu...
Benno Stein, Sven Meyer zu Eissen
COMCOM
2010
90views more  COMCOM 2010»
13 years 7 months ago
The room shortage problem of tree-based ZigBee/IEEE 802.15.4 wireless networks
A number of IEEE 802.15.4 devices can form a tree topology as proposed by ZigBee specification. The ability to confine the shape and extent of the tree serves as the basis for add...
Li-Hsing Yen, Wei-Ting Tsai