3020 search results - page 108 / 604 » Optimal partition trees |
188
click to vote
DAM
2002
15 years 6 months ago
2002
We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between p...
161
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
195
click to vote
SPAA
1993
ACM
15 years 10 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
171
Voted
FLAIRS
2001
15 years 7 months ago
2001
We introduce a new genetic operator, Reduction, that rectifies decision trees not correct syntactically and at the same time removes the redundant sections within, while preservin...
163
click to vote
INFOCOM
2006
IEEE
16 years 7 days ago
2006
IEEE
— We address the problem of energy efficient sensing by adaptively coordinating the sleep schedules of sensor nodes while guaranteeing that values of sleeping nodes can be recov...