Sciweavers

216 search results - page 24 / 44
» On the number of minima of a random polynomial
Sort
View
CC
2010
Springer
135views System Software» more  CC 2010»
13 years 7 months ago
Counting Irreducible Components of Complex Algebraic Varieties
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
Peter Bürgisser, Peter Scheiblechner
ASPDAC
2010
ACM
135views Hardware» more  ASPDAC 2010»
13 years 5 months ago
Statistical timing verification for transparently latched circuits through structural graph traversal
Level-sensitive transparent latches are widely used in high-performance sequential circuit designs. Under process variations, the timing of a transparently latched circuit will ada...
Xingliang Yuan, Jia Wang
PAIRING
2009
Springer
119views Cryptology» more  PAIRING 2009»
14 years 2 months ago
Compact E-Cash and Simulatable VRFs Revisited
Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing...
Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, A...
IJCNN
2007
IEEE
14 years 1 months ago
Upper Bound on Pattern Storage in Feedforward Networks
—Starting from the strict interpolation equations for multivariate polynomials, an upper bound is developed for the number of patterns that can be memorized by a nonlinear feedfo...
Pramod Lakshmi Narasimha, Michael T. Manry, Franci...
DAM
2010
120views more  DAM 2010»
13 years 7 months ago
A new approximation algorithm for the multilevel facility location problem
In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP rounding. The linear ...
Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren