Sciweavers

778 search results - page 45 / 156
» Bounding Smooth Integers
Sort
View
JC
2011
87views more  JC 2011»
13 years 2 months ago
Lower bounds for the complexity of linear functionals in the randomized setting
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
Erich Novak, Henryk Wozniakowski
CCA
2009
Springer
14 years 2 months ago
Curves That Must Be Retraced
We exhibit a polynomial time computable plane curve Γ that has finite length, does not intersect itself, and is smooth except at one endpoint, but has the following property. For...
Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo
FOCS
2009
IEEE
14 years 2 months ago
Higher Eigenvalues of Graphs
— We present a general method for proving upper bounds on the eigenvalues of the graph Laplacian. In particular, we show that for any positive integer k, the kth smallest eigenva...
Jonathan A. Kelner, James R. Lee, Gregory N. Price...
EUROPAR
2005
Springer
14 years 1 months ago
Replication Predicates for Dependent-Failure Algorithms
Abstract. To establish lower bounds on the amount of replication, there is a common partition argument used to construct indistinguishable executions such that one violates some pr...
Flavio Paiva Junqueira, Keith Marzullo
DATE
1998
IEEE
93views Hardware» more  DATE 1998»
13 years 12 months ago
Exact and Approximate Estimation for Maximum Instantaneous Current of CMOS Circuits
We present an integer-linear-programming-based approach for estimating the maximum instantaneous current through the power supply lines for CMOS circuits. It produces the exact so...
Yi-Min Jiang, Kwang-Ting Cheng