Sciweavers

2252 search results - page 198 / 451
» Improving Random Forests
Sort
View
DCC
2006
IEEE
16 years 6 months ago
Asymptotic Nonlinearity of Boolean Functions
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...
François Rodier
DASFAA
2009
IEEE
146views Database» more  DASFAA 2009»
16 years 2 months ago
In-Page Logging B-Tree for Flash Memory
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 ...
Gap-Joo Na, Bongki Moon, Sang-Won Lee
COCO
2009
Springer
96views Algorithms» more  COCO 2009»
16 years 1 months ago
One-Way Functions and the Berman-Hartmanis Conjecture
—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...
Manindra Agrawal, Osamu Watanabe
ICDCSW
2008
IEEE
16 years 1 months ago
Heuristic Relay Node Selection Algorithm for One-Hop Overlay Routing
—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 ...
Yin Chen, Li Tang, Jun Li
ICPR
2008
IEEE
16 years 1 months ago
Graph drawing using quantum commute time
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...
David Emms, Edwin R. Hancock, Richard C. Wilson