15073 search results - page 114 / 3015 » Probabilistic algorithms for computing resultants |
140
Voted
CORR
2012
Springer
13 years 11 months ago
2012
Springer
We show that the log-likelihood of several probabilistic graphical models is Lipschitz continuous with respect to the p-norm of the parameters. We discuss several implications ...
100
click to vote
DSN
2000
IEEE
15 years 7 months ago
2000
IEEE
ÐWe study the quality of service (QoS) of failure detectors. By QoS, we mean a specification that quantifies 1) how fast the failure detector detects actual failures and 2) how we...
129
click to vote
AAECC
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We present new faster deterministic and probabilistic recombination algorithms to compute the irreducible decomposition of a bivariate polynomial via the classical Hensel...
121
click to vote
ALDT
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting ...
141
Voted
COCO
2001
Springer
15 years 8 months ago
2001
Springer
Restricting the search space {0, 1}n to the set of truth tables of “easy” Boolean functions on log n variables, as well as using some known hardness-randomness tradeoffs, we ...