2252 search results - page 189 / 451 » Improving Random Forests |
176
Voted
CRYPTO
2003
Springer
15 years 7 months ago
2003
Springer
We consider the problem of constructing randomness extractors that are locally computable; that is, read only a small number of bits from their input. As recently shown by Lu (thi...
121
click to vote
ATS
2000
IEEE
15 years 7 months ago
2000
IEEE
Testing of embedded cores is very difficult in SOC (system-on-a-chip), since the core user may not know the gate level implementation of the core, and the controllability and obse...
118
click to vote
ICCD
2000
IEEE
15 years 7 months ago
2000
IEEE
This paper presents a verification technique for functional comparison of large combinational circuits using a novel combination of known approaches. The idea is based on a tight...
107
Voted
STOC
1999
ACM
15 years 7 months ago
1999
ACM
In this paper we prove a theorem that gives an (almost) tight upper bound on the sensitivity of a multiple-output Boolean function in terms of the sensitivity of its coordinates an...
87
Voted
ICDCS
1999
IEEE
15 years 7 months ago
1999
IEEE
In this paper we examine the problem of balancing load in a large-scale distributed system when information about server loads may be stale. It is well known that sending each req...