1068 search results - page 5 / 214 » Extremely randomized trees |
DAM
2010
13 years 8 months ago
2010
We study the quantity distance between node j and node n in a random tree of size n for increasing tree families. We give closed formul
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
VLDB
1999
ACM
14 years 25 days ago
1999
ACM
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
IJON
2007
13 years 8 months ago
2007
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
DAGSTUHL
2007
13 years 10 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...