Sciweavers

127 search results - page 12 / 26
» Simple 8-Designs with Small Parameters
Sort
View
PKDD
2010
Springer
158views Data Mining» more  PKDD 2010»
14 years 10 months ago
Learning Sparse Gaussian Markov Networks Using a Greedy Coordinate Ascent Approach
In this paper, we introduce a simple but efficient greedy algorithm, called SINCO, for the Sparse INverse COvariance selection problem, which is equivalent to learning a sparse Ga...
Katya Scheinberg, Irina Rish
NOMS
2008
IEEE
181views Communications» more  NOMS 2008»
15 years 6 months ago
Coordinated management of power usage and runtime performance
— With the continued growth of computing power and reduction in physical size of enterprise servers, the need for actively managing electrical power usage in large datacenters is...
Malgorzata Steinder, Ian Whalley, James E. Hanson,...
CAV
2004
Springer
154views Hardware» more  CAV 2004»
15 years 3 months ago
Automatic Verification of Sequential Consistency for Unbounded Addresses and Data Values
Sequential consistency is the archetypal correctness condition for the memory protocols of shared-memory multiprocessors. Typically, such protocols are parameterized by the number ...
Jesse D. Bingham, Anne Condon, Alan J. Hu, Shaz Qa...
CVPR
2008
IEEE
16 years 1 months ago
Learning Bayesian Networks with qualitative constraints
Graphical models such as Bayesian Networks (BNs) are being increasingly applied to various computer vision problems. One bottleneck in using BN is that learning the BN model param...
Yan Tong, Qiang Ji
IJCV
2007
113views more  IJCV 2007»
14 years 11 months ago
Vision and Rain
The visual effects of rain are complex. Rain produces sharp intensity changes in images and videos that can severely impair the performance of outdoor vision systems. In this paper...
Kshitiz Garg, Shree K. Nayar