Sciweavers

16666 search results - page 3185 / 3334
» Descriptive and Computational Complexity
Sort
View
181
Voted
CORR
2012
Springer
170views Education» more  CORR 2012»
14 years 8 days 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
14 years 4 days 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
14 years 4 days 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
SIGCOMM
2012
ACM
13 years 7 months ago
Abstractions for network update
ions for Network Update Mark Reitblatt Cornell Nate Foster Cornell Jennifer Rexford Princeton Cole Schlesinger Princeton David Walker Princeton Configuration changes are a common...
Mark Reitblatt, Nate Foster, Jennifer Rexford, Col...
160
Voted
SIGCOMM
2012
ACM
13 years 7 months ago
DeTail: reducing the flow completion time tail in datacenter networks
Web applications have now become so sophisticated that rendering a typical page may require hundreds of intra-datacenter flows. At the same time, web sites must meet strict page ...
David Zats, Tathagata Das, Prashanth Mohan, Dhruba...
« Prev « First page 3185 / 3334 Last » Next »