Sciweavers

ARCS
2006
Springer
13 years 8 months ago
Power-Aware Collective Tree Exploration
An n-node tree has to be explored by a group of k mobile robots deployed initially at the root. Robots traverse the edges of the tree until all nodes are visited. We would like to ...
Miroslaw Dynia, Miroslaw Korzeniowski, Christian S...
KGC
1997
Springer
13 years 8 months ago
Alogtime Algorithms for Tree Isomorphism, Comparison, and Canonization
The tree isomorphism problem is the problem of determining whether two trees are isomorphic. The tree canonization problem is the problem of producing a canonical tree isomorphic t...
Samuel R. Buss
STACS
1999
Springer
13 years 8 months ago
Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
Ming-Yang Kao, Andrzej Lingas, Anna Östlin
IPPS
1998
IEEE
13 years 8 months ago
Optimally Locating a Structured Facility of a Specified Length in a Weighted Tree Network
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...
Shan-Chyun Ku, Biing-Feng Wang
INFOCOM
1999
IEEE
13 years 8 months ago
Ring versus Tree Embedding for Real-time Group Multicast
In general topology networks, routing from one node to another over a tree embedded in the network is intuitively a good strategy, since it typically results in a route length of O...
Mario Baldi, Yoram Ofek
ICIP
1999
IEEE
13 years 8 months ago
On the Use of Context Tree for Binary Image Compression
We consider the use of a static context tree for binary image compression. The contexts are stored in the leaves of a variable-depth binary tree. The tree structure itself is full...
Pasi Fränti, Eugene I. Ageenko
SIGMOD
1999
ACM
122views Database» more  SIGMOD 1999»
13 years 8 months ago
BOAT-Optimistic Decision Tree Construction
Classification is an important data mining problem. Given a training database of records, each tagged with a class label, the goal of classification is to build a concise model ...
Johannes Gehrke, Venkatesh Ganti, Raghu Ramakrishn...
LICS
2002
IEEE
13 years 9 months ago
Tree Extension Algebras: Logics, Automata, and Query Languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Michael Benedikt, Leonid Libkin
EUROPAR
2003
Springer
13 years 9 months ago
Parallelization with Tree Skeletons
Abstract. Trees are useful data structures, but to design efficient parallel programs over trees is known to be more difficult than to do over lists. Although several important tre...
Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi
ICDCS
2003
IEEE
13 years 9 months ago
Optimal Distribution Tree for Internet Streaming Media
Internet radio and television stations require significant bandwidth to support delivery of high quality audio and video streams to a large number of receivers. IP multicast is a...
Min Sik Kim, Simon S. Lam, Dong-Young Lee