522 search results - page 37 / 105 » The 3-Steiner Root Problem |
106
click to vote
KDD
1994
ACM
15 years 1 months ago
1994
ACM
: The problem of transforming the knowledge bases of performance systems using induced rules or decision trees into comprehensible knowledgestructures is addressed. A knowledgestru...
SWAT
1994
Springer
15 years 1 months ago
1994
Springer
This paper gives a CREW PRAM algorithm for the problem of finding lowest common ancestors in a forest under the insertion of leaves and roots and the deletion of leaves. For a fore...
COMPGEOM
1990
ACM
15 years 1 months ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
103
click to vote
DEXAW
2007
IEEE
15 years 1 months ago
2007
IEEE
The problem of efficiently evaluating XPath and XQuery queries has become increasingly significant since more and more XML data is stored in its native form. We propose a novel op...
ARCS
2006
Springer
15 years 1 months ago
2006
Springer
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 ...