Sciweavers

3055 search results - page 74 / 611
» Randomized Search Trees
Sort
View
JPDC
2002
104views more  JPDC 2002»
13 years 10 months ago
Fully dynamic distributed search trees can be balanced in O(lg2 N) time
In this paper we consider the dictionary problem in a message-passing distributed environment. We introduce a new version, based on AVL-trees, of distributed search trees, the fir...
Fabio Barillari, Enrico Nardelli, Massimo Pepe
ICDM
2009
IEEE
113views Data Mining» more  ICDM 2009»
14 years 4 months ago
Spatiotemporal Relational Random Forests
Abstract—We introduce and validate Spatiotemporal Relational Random Forests, which are random forests created with spatiotemporal relational probability trees. We build on the do...
Timothy A. Supinie, Amy McGovern, John Williams, J...
ILP
2004
Springer
14 years 3 months ago
First Order Random Forests with Complex Aggregates
Random forest induction is a bagging method that randomly samples the feature set at each node in a decision tree. In propositional learning, the method has been shown to work well...
Celine Vens, Anneleen Van Assche, Hendrik Blockeel...
TAMC
2009
Springer
14 years 4 months ago
Searching Trees: An Essay
We are reviewing recent advances in the run time analysis of search tree algorithms, including indications to open problems. In doing so, we also try to cover the historical dimens...
Henning Fernau, Daniel Raible
ISCAS
2006
IEEE
94views Hardware» more  ISCAS 2006»
14 years 4 months ago
Relaxed tree search MIMO signal detection algorithm design and VLSI implementation
Abstract— This paper presents an implementation-oriented breadthfirst tree search MIMO detector design solution. Techniques at algorithm and VLSI architecture levels are develop...
Sizhong Chen, Tong Zhang, M. Goel