Sciweavers

1380 search results - page 11 / 276
» A General Polynomial Sieve
Sort
View
DAC
2011
ACM
12 years 8 months ago
Fast non-monte-carlo transient noise analysis for high-precision analog/RF circuits by stochastic orthogonal polynomials
Stochastic device noise has become a significant challenge for high-precision analog/RF circuits, and it is particularly difficult to correctly include both white noise and flic...
Fang Gong, Hao Yu, Lei He
ICCV
2011
IEEE
12 years 8 months ago
Generalized Roof Duality for Pseudo-Boolean Optimization
The number of applications in computer vision that model higher-order interactions has exploded over the last few years. The standard technique for solving such problems is to red...
Fredrik Kahl, Petter Strandmark
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
13 years 10 months ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
S. Thomas McCormick, Akiyoshi Shioura
COCO
2009
Springer
96views Algorithms» more  COCO 2009»
14 years 3 months ago
Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-in
In this paper we give reconstruction algorithms for depth-3 arithmetic circuits with k multiplication gates (also known as ΣΠΣ(k) circuits), where k = O(1). Namely, we give an ...
Zohar Shay Karnin, Amir Shpilka
ISSAC
1998
Springer
111views Mathematics» more  ISSAC 1998»
14 years 25 days ago
A Subresultant Theory for Ore Polynomials with Applications
The subresultant theory for univariate commutative polynomials is generalized to Ore polynomials. The generalization includes: the subresultant theorem, gap structure, and subresu...
Ziming Li