Sciweavers

1503 search results - page 61 / 301
» Self-optimizing distributed trees
Sort
View
NIPS
1996
13 years 11 months ago
Hidden Markov Decision Trees
We study a time series model that can be viewed as a decision tree with Markov temporal structure. The model is intractable for exact calculations, thus we utilize variational app...
Michael I. Jordan, Zoubin Ghahramani, Lawrence K. ...
CPC
2002
80views more  CPC 2002»
13 years 9 months ago
The Wiener Index Of Random Trees
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
Ralph Neininger
JCT
2008
57views more  JCT 2008»
13 years 10 months ago
Invariant boundary distributions for finite graphs
Let be the fundamental group of a finite connected graph G. Let M be an abelian group. A distribution on the boundary of the universal covering tree is an M-valued measure defin...
Guyan Robertson
CAIP
2009
Springer
114views Image Analysis» more  CAIP 2009»
14 years 1 months ago
Decision Trees Using the Minimum Entropy-of-Error Principle
Binary decision trees based on univariate splits have traditionally employed so-called impurity functions as a means of searching for the best node splits. Such functions use estim...
Joaquim Marques de Sá, João Gama, Ra...
ISCC
2005
IEEE
14 years 3 months ago
Optimizing the Reliable Distribution of Large Files within CDNs
Abstract Content Delivery Networks (CDNs) provide an efficient support for serving http and streaming media content while minimizing the network impact of content delivery as well...
Ludmila Cherkasova