Sciweavers

43 search results - page 2 / 9
» Unbiased Matrix Rounding
Sort
View
ISQED
2008
IEEE
153views Hardware» more  ISQED 2008»
13 years 11 months ago
Accelerating Clock Mesh Simulation Using Matrix-Level Macromodels and Dynamic Time Step Rounding
Clock meshes have found increasingly wide applications in today’s high-performance IC designs. The inherent routing redundancies associated with clock meshes lead to improved cl...
Xiaoji Ye, Min Zhao, Rajendran Panda, Peng Li, Jia...
WAOA
2005
Springer
92views Algorithms» more  WAOA 2005»
13 years 10 months ago
Rounding of Sequences and Matrices, with Applications
Abstract. We show that any real matrix can be rounded to an integer matrix in such a way that the rounding errors of all row sums are less than one, and the rounding errors of all ...
Benjamin Doerr, Tobias Friedrich, Christian Klein,...
FOCS
2008
IEEE
13 years 11 months ago
Spherical Cubes and Rounding in High Dimensions
What is the least surface area of a shape that tiles Rd under translations by Zd ? Any such shape must have volume 1 and hence surface area at least that of the volume-1 ball, nam...
Guy Kindler, Ryan O'Donnell, Anup Rao, Avi Wigders...
JCB
2007
198views more  JCB 2007»
13 years 5 months ago
Bayesian Hierarchical Model for Large-Scale Covariance Matrix Estimation
Many bioinformatics problems can implicitly depend on estimating large-scale covariance matrix. The traditional approaches tend to give rise to high variance and low accuracy esti...
Dongxiao Zhu, Alfred O. Hero III
COLT
2008
Springer
13 years 7 months ago
More Efficient Internal-Regret-Minimizing Algorithms
Standard no-internal-regret (NIR) algorithms compute a fixed point of a matrix, and hence typically require O(n3 ) run time per round of learning, where n is the dimensionality of...
Amy R. Greenwald, Zheng Li, Warren Schudy