2252 search results - page 161 / 451 » Improving Random Forests |
DAC
1997
ACM
13 years 12 months ago
1997
ACM
We propose a methodology for applying gate-level logic transformations to optimize power in digital circuits. Statistically simulated[14] switching information, gate delays, signa...
ACL
2008
13 years 9 months ago
2008
The paper presents a novel sentence trimmer in Japanese, which combines a non-statistical yet generic tree generation model and Conditional Random Fields (CRFs), to address improv...
NAACL
2007
13 years 9 months ago
2007
We relate the problem of finding the best application of a Synchronous ContextFree Grammar (SCFG) rule during parsing to a Markov Random Field. This representation allows us to u...
MST
2008
13 years 8 months ago
2008
Abstract The transformation protocol can allow two players to share an unconditionally secure secret key using a random deal of cards. A sufficient condition on the number of cards...
SIAMDM
2008
13 years 8 months ago
2008
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n 2ck contains a K4 whose edges receive at most two colors. Th...