317 search results - page 20 / 64 » Computing and Updating the Process Number in Trees |
183
click to vote
ICDE
1999
IEEE
16 years 2 months ago
1999
IEEE
The ability to model the temporal dimension is essential to many applications. Furthermore, the rate of increase in database size and response time requirements has outpaced advan...
109
click to vote
TPDS
2008
15 years 1 months ago
2008
This paper proposes a new methodology to model the distribution of finite size content to a group of users connected through an overlay network. Our methodology describes the distr...
113
click to vote
PKDD
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. In preference learning, the algorithm observes pairwise relative judgments (preference) between items as training data for learning an ordering of all items. This is an i...
145
click to vote
IS
2011
14 years 5 months ago
2011
In this paper we present algorithms for building and maintaining efficient collection trees that provide the conduit to disseminate data required for processing monitoring queries...
ICIC
2009
Springer
14 years 11 months ago
2009
Springer
In this paper we present a study on the Random Forest (RF) family of ensemble methods. From our point of view, a "classical" RF induction process presents two main drawba...