Sciweavers

822 search results - page 24 / 165
» Descendants in Increasing Trees
Sort
View
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 7 months ago
Gaussian Process Bandits for Tree Search
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
Louis Dorard, John Shawe-Taylor
ACTA
2008
88views more  ACTA 2008»
13 years 6 months ago
Weighted height of random trees
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of items is recursively partitioned. Our model allows for more flexibility in the cho...
Nicolas Broutin, Luc Devroye, Erin McLeish
ICDE
2008
IEEE
142views Database» more  ICDE 2008»
14 years 9 months ago
An Inflationary Fixed Point Operator in XQuery
ct The backbone of the XML data model, namely ordered, unranked trees, is inherently recursive and it is natural to equip the associated languages with constructs that can query su...
Loredana Afanasiev, Torsten Grust, Maarten Marx, J...
HICSS
1996
IEEE
74views Biometrics» more  HICSS 1996»
13 years 12 months ago
Querying Structured Hyperdocuments
In this paper, we present a document model which integrates the logical structure and hypertext link structure of hyperdocuments in order to manage structured documents with hyper...
Yong Kyu Lee, Seong-Joon Yoo, Kyoungro Yoon, P. Br...
CLUSTER
2008
IEEE
13 years 9 months ago
Variable-grain and dynamic work generation for Minimal Unique Itemset mining
Abstract--SUDA2 is a recursive search algorithm for Minimal Unique Itemset detection. Such sets of items are formed via combinations of non-obvious attributes enabling individual r...
Paraskevas Yiapanis, David J. Haglin, Anna M. Mann...