2492 search results - page 128 / 499 » On the General Signature Trees |
126
click to vote
CPC
2006
15 years 6 months ago
2006
Abstract. Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deter...
188
click to vote
PPOPP
2012
ACM
14 years 2 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
184
click to vote
COLT
1995
Springer
15 years 10 months ago
1995
Springer
The Noise Sensitivity Signature (NSS), originally introduced by Grossman and Lapedes (1993), was proposed as an alternative to cross validation for selecting network complexity. I...
143
click to vote
ISLPED
2006
ACM
16 years 11 days ago
2006
ACM
This paper addresses the problem of low-power fanout optimization. We show that due to neglecting short-circuit current, previous analytical techniques proposed to optimize the ar...
183
click to vote
NIPS
2004
15 years 7 months ago
2004
In this paper, we explore the use of Random Forests (RFs) in the structured language model (SLM), which uses rich syntactic information in predicting the next word based on words ...