Sciweavers

29908 search results - page 5963 / 5982
» On the complexity of communication complexity
Sort
View
CORR
2012
Springer
170views Education» more  CORR 2012»
12 years 3 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
HPCA
2012
IEEE
12 years 3 months ago
SCD: A scalable coherence directory with flexible sharer set encoding
Large-scale CMPs with hundreds of cores require a directory-based protocol to maintain cache coherence. However, previously proposed coherence directories are hard to scale beyond...
Daniel Sanchez, Christos Kozyrakis
HPCA
2012
IEEE
12 years 3 months ago
Power balanced pipelines
Since the onset of pipelined processors, balancing the delay of the microarchitectural pipeline stages such that each microarchitectural pipeline stage has an equal delay has been...
John Sartori, Ben Ahrens, Rakesh Kumar
IHI
2012
249views Healthcare» more  IHI 2012»
12 years 3 months ago
An intelligent web-based decision support tool for enhancing asthma guideline adherence
Asthma is a leading chronic disease of children and currently affects about 6.2 million (8.5%) children in the United States. National Asthma Education and Prevention Program (NAE...
Jinbo Bi, Arun Abraham
ISPD
2012
ACM
288views Hardware» more  ISPD 2012»
12 years 3 months ago
Construction of realistic gate sizing benchmarks with known optimal solutions
Gate sizing in VLSI design is a widely-used method for power or area recovery subject to timing constraints. Several previous works have proposed gate sizing heuristics for power ...
Andrew B. Kahng, Seokhyeong Kang
« Prev « First page 5963 / 5982 Last » Next »