Sciweavers

1423 search results - page 42 / 285
» Languages of Nested Trees
Sort
View
ESOP
2000
Springer
15 years 3 months ago
Improving the Representation of Infinite Trees to Deal with Sets of Trees
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
Laurent Mauborgne
COCOON
2005
Springer
15 years 5 months ago
Min-Energy Voltage Allocation for Tree-Structured Tasks
Westudyjobschedulingonprocessorscapableofrunningatvariablevoltage/speed tominimizeenergyconsumption.Eachjob ina probleminstanceisspecifiedbyitsarrivaltime and deadline, together w...
Minming Li, Becky Jie Liu, Frances F. Yao
CSDA
2006
91views more  CSDA 2006»
14 years 12 months ago
Maximum a posteriori pruning on decision trees and its application to bootstrap BUMPing
The cost-complexity pruning generates nested subtrees and selects the best one. However, its computational cost is large since it uses holdout sample or cross-validation. On the o...
Jinseog Kim, Yongdai Kim
DBPL
1993
Springer
141views Database» more  DBPL 1993»
15 years 3 months ago
Some Properties of Query Languages for Bags
In this paper we study the expressive power of query languages for nested bags. We de ne the ambient bag language by generalizing the constructs of the relational language of Brea...
Leonid Libkin, Limsoon Wong
WEBDB
2005
Springer
105views Database» more  WEBDB 2005»
15 years 5 months ago
On the Expressive Power of Node Construction in XQuery
In the relational model it has been shown that the flat relational algebra has the same expressive power as the nested relational algebra, as far as queries over flat relations ...
Wim Le Page, Jan Hidders, Philippe Michiels, Jan P...