2252 search results - page 194 / 451 » Improving Random Forests |
266
click to vote
SAC
2008
ACM
15 years 6 months ago
2008
ACM
Software-based self-test (SBST) is emerging as a promising technology for enabling at-speed testing of high-speed embedded processors testing in an SoC system. For SBST, test rout...
161
click to vote
SIGGRAPH
2009
ACM
16 years 1 months ago
2009
ACM
We present a novel bounding volume hierarchy (BVH) compression and decompression method transparently supporting random access on the compressed BVHs. To support random access on ...
209
click to vote
DEXAW
2005
IEEE
16 years 4 days ago
2005
IEEE
In this paper we present Energy Aware Random Asynchronous Wakeup (RAW-E), a novel crosslayer power management and routing protocol for heterogeneous wireless sensor and actor netw...
200
click to vote
SAC
2003
ACM
15 years 11 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
182
click to vote
IPM
2007
15 years 6 months ago
2007
We describe a compression model for semistructured documents, called Structural Contexts Model (SCM), which takes advantage of the context information usually implicit in the stru...