1068 search results - page 99 / 214 » Extremely randomized trees |
ICMCS
2005
IEEE
14 years 3 months ago
2005
IEEE
In this paper, we propose an integrated error resilient MDC scheme for wireless networks with both packet loss and random bit errors. Two descriptions are first generated independ...
GLVLSI
2003
IEEE
14 years 3 months ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
CDC
2009
IEEE
14 years 1 months ago
2009
IEEE
Abstract— The paper investigates theoretical issues in applying the universal swarming technique to efficient content distribution. In a swarming session, a file is distributed...
INFORMATICALT
2008
13 years 10 months ago
2008
Abstract. Data stream mining has become a novel research topic of growing interest in knowledge discovery. Most proposed algorithms for data stream mining assume that each data blo...
PODC
2011
ACM
13 years 25 days ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...