450 search results - page 53 / 90 » Satisfiability with Exponential Families |
102
click to vote
SIGCOMM
1996
ACM
15 years 4 months ago
1996
ACM
Abstract-- We present a Start-time Fair Queueing (SFQ) algorithm that is computationally efficient and achieves fairness regardless of variation in a server capacity. We analyze it...
ANNPR
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Estimation of probability density functions (pdf) is one major topic in pattern recognition. Parametric techniques rely on an arbitrary assumption on the form of the unde...
ESA
2006
Springer
15 years 3 months ago
2006
Springer
The sequential importance sampling (SIS) algorithm has gained considerable popularity for its empirical success. One of its noted applications is to the binary contingency tables p...
FSE
2006
Springer
15 years 3 months ago
2006
Springer
The security of hash functions has recently become one of the hottest topics in the design and analysis of cryptographic primitives. Since almost all the hash functions used today ...
108
click to vote
EUROCRYPT
2010
Springer
15 years 3 months ago
2010
Springer
We present a family of verifiable random functions which are provably secure for exponentially-large input spaces under a non-interactive complexity assumption. Prior construction...