2252 search results - page 198 / 451 » Improving Random Forests |
101
click to vote
DCC
2006
IEEE
16 years 3 months ago
2006
IEEE
Boolean functions on the space Fm 2 are not only important in the theory of error-correcting codes, but also in cryptography. In these two cases, the nonlinearity of these functio...
108
click to vote
DASFAA
2009
IEEE
15 years 10 months ago
2009
IEEE
We demonstrate the IPL B+ -tree prototype, which has been designed as a flash-aware index structure by adopting the in-page logging (IPL) scheme. The IPL scheme has been proposed ...
132
click to vote
COCO
2009
Springer
15 years 10 months ago
2009
Springer
—The Berman-Hartmanis conjecture states that all NP-complete sets are P-isomorphic each other. On this conjecture, we first improve the result of [3] and show that all NP-comple...
152
click to vote
ICDCSW
2008
IEEE
15 years 10 months ago
2008
IEEE
—This paper reviews the characteristics of overlay networks and defines effective relay nodes that can improve the performance of interactive real-time applications. A heuristic ...
120
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, we explore experimentally the use of the commute time of the continuous-time quantum walk for graph drawing. For the classical random walk, the commute time has bee...