Results 11  20
of
2,239
Solving Large Quadratic Assignment Problems on Computational Grids
, 2000
"... The quadratic assignment problem (QAP) is among the hardest combinatorial optimization problems. Some instances of size n = 30 have remained unsolved for decades. The solution of these problems requires both improvements in mathematical programming algorithms and the utilization of powerful computat ..."
Abstract

Cited by 82 (7 self)
 Add to MetaCart
The quadratic assignment problem (QAP) is among the hardest combinatorial optimization problems. Some instances of size n = 30 have remained unsolved for decades. The solution of these problems requires both improvements in mathematical programming algorithms and the utilization of powerful
Quadratic Span Programs and Succinct NIZKs without PCPs
"... We introduce a new characterization of the NP complexity class, called Quadratic Span Programs (QSPs), which is a natural extension of span programs defined by Karchmer and Wigderson. Our main motivation is the construction of succinct arguments of NPstatements that are quick to construct and verif ..."
Abstract

Cited by 72 (8 self)
 Add to MetaCart
not (explicitly) use PCPs. But his scheme has some disadvantages – namely, the CRS size and prover computation are both quadratic in the circuit size. In 2011, Lipmaa reduced the CRS size to quasilinear, but with prover computation still quadratic. Using QSPs we construct a NIZK argument in the CRS model
Upper bound for the size of quadratic Siegel disks
 Inventiones Mathematicae
"... Abstract. If α is an irrational number, we let {pn/qn}n≥0, be the approximants given by its continued fraction expansion. The Bruno series B(α) is defined as B(α) = n≥0 log qn+1 qn The quadratic polynomial Pα: z 7 → e2ipiαz + z2 has an indifferent fixed point at the origin. If Pα is linearizable, w ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
Abstract. If α is an irrational number, we let {pn/qn}n≥0, be the approximants given by its continued fraction expansion. The Bruno series B(α) is defined as B(α) = n≥0 log qn+1 qn The quadratic polynomial Pα: z 7 → e2ipiαz + z2 has an indifferent fixed point at the origin. If Pα is linearizable
A sequential quadratic programming approach to concurrent gate and wire sizing
 IEEE International Conference on ComputerAided Design
, 1995
"... With an everincreasing portion of the delay in highspeed CMOS chips attributable to the interconnect, interconnectcircuit design automation continues to grow in importance. By transforming the gate and multilayer wire sizing problem into a convex programming problem for the Elmore delay approxim ..."
Abstract

Cited by 36 (1 self)
 Add to MetaCart
approximation, we demonstrate the efficacy of a sequential quadratic programming (SQP) solution method. For cases where accuracy greater than that provided by the Elmore delay approximation is required, we apply SQP to the gate and wire sizing problem with more accurate delay models. Since efficient
Quadratic exactsize and linear approximatesize random sampling of planar graphs
 In Proc. Analysis of Algorithms
, 2005
"... This extended abstract introduces a new algorithm for the random generation of labelled planar graphs. Its principles rely on Boltzmann samplers as recently developed by Duchon, Flajolet, Louchard, and Schaeffer. It combines the Boltzmann framework, a judicious use of rejection, a new combinatorial ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
preprocessing step of some fixed small cost. Then, for each generation, the time complexity is quadratic for exactsize uniform sampling and linear for approximatesize sampling. This greatly improves on the best previously known time complexity for exactsize uniform sampling of planar graphs with n vertices
A quadratic programming approach to simultaneous buffer insertion/sizing and wire sizing
 IEEE Trans. ComputerAided Design
, 1999
"... Abstract—In this paper, we present a completely new approach to the problem of delay minimization by simultaneous buffer insertion and wire sizing for a wire. We show that the problem can be formulated as a convex quadratic program, which is known to be solvable in polynomial time. Nevertheless, we ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
Abstract—In this paper, we present a completely new approach to the problem of delay minimization by simultaneous buffer insertion and wire sizing for a wire. We show that the problem can be formulated as a convex quadratic program, which is known to be solvable in polynomial time. Nevertheless, we
Multiparty Computation from Threshold Homomorphic Encryption
, 2001
"... Abstract. We introduce a new approach to multiparty computation (MPC) basing it on homomorphic threshold cryptosystems. We show that given keys for any sufficiently efficient system of this type, general MPC protocols for n parties can be devised which are secure against an active adversary that co ..."
Abstract

Cited by 166 (14 self)
 Add to MetaCart
that corrupts any minority of the parties. The total number of bits broadcast is O(nkC), where k is the security parameter and C  is the size of a (Boolean) circuit computing the function to be securely evaluated. An earlier proposal by Franklin and Haber with the same complexity was only secure for passive
IntegerValued Quadratic Forms and Quadratic Diophantine Equations
 DOCUMENTA MATH.
, 2006
"... We investigate several topics on a quadratic form Φ over an algebraic number field including the following three: (A) an equation ξΦ · t ξ = Ψ for another form Ψ of a smaller size; (B) classification of Φ over the ring of algebraic integers; (C) ternary forms. In (A) we show that the “class ” of s ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
We investigate several topics on a quadratic form Φ over an algebraic number field including the following three: (A) an equation ξΦ · t ξ = Ψ for another form Ψ of a smaller size; (B) classification of Φ over the ring of algebraic integers; (C) ternary forms. In (A) we show that the “class
Survey: Interpolation Methods in Medical Image Processing
 IEEE Transactions on Medical Imaging
, 1999
"... Abstract — Image interpolation techniques often are required in medical imaging for image generation (e.g., discrete back projection for inverse Radon transform) and processing such as compression or resampling. Since the ideal interpolation function spatially is unlimited, several interpolation ker ..."
Abstract

Cited by 161 (2 self)
 Add to MetaCart
kernels of finite size have been introduced. This paper compares 1) truncated and windowed sinc; 2) nearest neighbor; 3) linear; 4) quadratic; 5) cubic Bspline; 6) cubic; g) Lagrange; and 7) Gaussian interpolation and approximation techniques with kernel sizes from 1 2 1upto 8 2 8. The comparison is done
On the Size of Quadratic Siegel Disks: Part I.
, 2003
"... If α is an irrational number, we let {pn/qn}n≥0, be the approximants given by its continued fraction expansion. The Bruno series B(α) is defined as ∑ log qn+1 B(α) =. n≥0 The quadratic polynomial Pα: z ↦ → e 2iπα z+z 2 has an indifferent fixed point at the origin. If Pα is linearizable, we let r(α) ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
If α is an irrational number, we let {pn/qn}n≥0, be the approximants given by its continued fraction expansion. The Bruno series B(α) is defined as ∑ log qn+1 B(α) =. n≥0 The quadratic polynomial Pα: z ↦ → e 2iπα z+z 2 has an indifferent fixed point at the origin. If Pα is linearizable, we let r
Results 11  20
of
2,239