2252 search results - page 163 / 451 » Improving Random Forests |
101
click to vote
ASYNC
1997
IEEE
15 years 6 months ago
1997
IEEE
This paper presents an in-depth case study in highperformance asynchronous adder design. A recent method, called “speculative completion”, is used. This method uses single-rai...
109
click to vote
AAAI
1997
15 years 3 months ago
1997
One of the important components of a local search strategy for satisfiability testing is the variable selection heuristic, which determines the next variable to be flipped. In a...
110
Voted
ICML
2010
IEEE
15 years 3 months ago
2010
IEEE
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
RSA
2006
15 years 2 months ago
2006
: On input a random 3-CNF formula of clauses-to-variables ratio r3 applies repeatedly the following simple heuristic: Set to True a literal that appears in the maximum number of cl...
136
Voted
TC
2008
15 years 2 months ago
2008
In a distributed key distribution scheme, a set of servers help a set of users in a group to securely obtain a common key. Security means that an adversary who corrupts some server...