Sciweavers

12289 search results - page 1843 / 2458
» computing 2006
Sort
View
CORR
2006
Springer
123views Education» more  CORR 2006»
15 years 7 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah
CORR
2006
Springer
91views Education» more  CORR 2006»
15 years 7 months ago
Quasi-friendly sup-interpretations
In a previous paper [16], the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static an...
Jean-Yves Marion, Romain Péchoux
CORR
2006
Springer
146views Education» more  CORR 2006»
15 years 7 months ago
Oblivious-Transfer Amplification
Abstract. Oblivious transfer (OT) is a primitive of paramount importance in cryptography or, more precisely, two- and multi-party computation due to its universality. Unfortunately...
Jürg Wullschleger
CSDA
2006
98views more  CSDA 2006»
15 years 7 months ago
Fast estimation algorithm for likelihood-based analysis of repeated categorical responses
Likelihood-based marginal regression modelling for repeated, or otherwise clustered, categorical responses is computationally demanding. This is because the number of measures nee...
Jukka Jokinen
CSSE
2006
IEEE
15 years 7 months ago
Experimental analysis of a privacy-preserving scalar product protocol
The recent investigation of privacy-preserving data mining has been motivated by the growing concern about the privacy of individuals when their data is stored, aggregated, and mi...
Zhiqiang Yang, Rebecca N. Wright, Hiranmayee Subra...
« Prev « First page 1843 / 2458 Last » Next »