Sciweavers

15073 search results - page 393 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
DAC
1996
ACM
15 years 10 months ago
Computing Parametric Yield Adaptively Using Local Linear Models
Abstract A divide-and-conquer algorithm for computing the parametric yield of large analog circuits is presented. The algorithm targets applications whose performance spreads could...
Mien Li, Linda S. Milor
CIKM
2010
Springer
15 years 4 months ago
Computing the top-k maximal answers in a join of ranked lists
Complex search tasks that utilize information from several data sources, are answered by integrating the results of distinct basic search queries. In such integration, each basic ...
Mirit Shalem, Yaron Kanza
ECCC
2011
234views ECommerce» more  ECCC 2011»
15 years 1 months ago
On the complexity of computational problems regarding distributions (a survey)
We consider two basic computational problems regarding discrete probability distributions: (1) approximating the statistical difference (aka variation distance) between two given d...
Oded Goldreich, Salil P. Vadhan
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
16 years 3 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...
SIAMSC
2008
97views more  SIAMSC 2008»
15 years 6 months ago
Numerical Methods for Computing Nonlinear Eigenpairs: Part II. Non-Iso-Homogeneous Cases
Standing (solitary)-wave/steady-state solutions in many nonlinear wave motions and Schrodinger flows lead to nonlinear eigenproblems. In [X. Yao and J. Zhou, SIAM J. Sci. Comput., ...
Xudong Yao, Jianxin Zhou