Sciweavers

1060 search results - page 35 / 212
» On the Discovery of Random Trees
Sort
View
CORR
2012
Springer
222views Education» more  CORR 2012»
13 years 5 months ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
FOCS
2007
IEEE
15 years 4 months ago
Reconstruction for Models on Random Graphs
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given ‘far away’ observations. Sever...
Antoine Gerschenfeld, Andrea Montanari
IJCAI
1993
14 years 11 months ago
Induction of Oblique Decision Trees
This article describes a new system for induction of oblique decision trees. This system, OC1, combines deterministic hill-climbing with two forms of randomization to nd a good ob...
David G. Heath, Simon Kasif, Steven Salzberg
SAC
2006
ACM
15 years 3 months ago
Induction of compact decision trees for personalized recommendation
We propose a method for induction of compact optimal recommendation policies based on discovery of frequent itemsets in a purchase database, followed by the application of standar...
Daniel Nikovski, Veselin Kulev
AAAI
2004
14 years 11 months ago
Temperature Discovery Search
Temperature Discovery Search (TDS) is a new minimaxbased game tree search method designed to compute or approximate the temperature of a combinatorial game. TDS is based on the co...
Martin Müller 0003, Markus Enzenberger, Jonat...