Sciweavers

720 search results - page 132 / 144
» Linear k-arboricities on trees
Sort
View
JSA
2006
97views more  JSA 2006»
14 years 9 months ago
Dynamic feature selection for hardware prediction
It is often possible to greatly improve the performance of a hardware system via the use of predictive (speculative) techniques. For example, the performance of out-of-order micro...
Alan Fern, Robert Givan, Babak Falsafi, T. N. Vija...
ISCI
2007
130views more  ISCI 2007»
14 years 9 months ago
Learning to classify e-mail
In this paper we study supervised and semi-supervised classification of e-mails. We consider two tasks: filing e-mails into folders and spam e-mail filtering. Firstly, in a sup...
Irena Koprinska, Josiah Poon, James Clark, Jason C...
TC
2010
14 years 8 months ago
Scalable Node-Level Computation Kernels for Parallel Exact Inference
—In this paper, we investigate data parallelism in exact inference with respect to arbitrary junction trees. Exact inference is a key problem in exploring probabilistic graphical...
Yinglong Xia, Viktor K. Prasanna
EGH
2009
Springer
14 years 7 months ago
Object partitioning considered harmful: space subdivision for BVHs
A major factor for the efficiency of ray tracing is the use of good acceleration structures. Recently, bounding volume hierarchies (BVHs) have become the preferred acceleration st...
Stefan Popov, Iliyan Georgiev, Rossen Dimov, Phili...
TIT
2011
149views more  TIT 2011»
14 years 4 months ago
Network Coding for Computing: Cut-Set Bounds
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
Rathinakumar Appuswamy, Massimo Franceschetti, Nik...