1237 search results - page 16 / 248 » Abstract shade trees |
107
click to vote
PAAPP
2006
15 years 4 months ago
2006
Abstract: We examine a new approach to building decision tree by introducing a geometric splitting criterion, based on the properties of a family of metrics on the space of partiti...
117
click to vote
TOC
2008
15 years 4 months ago
2008
Abstract: We give a quantum algorithm for the binary NAND tree problem in the Hamiltonian oracle model. The algorithm uses a continuous time quantum walk with a running time propor...
135
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Various methods have been used to represent a tree on n nodes in essentially the informationtheoretic minimum space while supporting various navigational operations in co...
160
click to vote
COCOA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. The node-weighted Steiner tree problem is a variation of classical Steiner minimum tree problem. Given a graph G = (V, E) with node weight function C : V → R+ and a sub...
142
click to vote
ICCS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Many knowledge representation mechanisms consist of linkbased structures; they may be studied formally by means of unordered trees. Here we consider the case where labels...