Sciweavers

85 search results - page 6 / 17
» A Randomized Solver for Linear Systems with Exponential Conv...
Sort
View
STOC
2005
ACM
101views Algorithms» more  STOC 2005»
14 years 7 months ago
Lower bounds for k-DNF resolution on random 3-CNFs
We prove exponential lower bounds for the refutation of a random 3-CNF with linear number of clauses by k-DNF Resolution for k log n/ log log n. For this we design a specially ta...
Michael Alekhnovich
CRYPTO
2011
Springer
195views Cryptology» more  CRYPTO 2011»
12 years 7 months ago
Time-Lock Puzzles in the Random Oracle Model
Abstract. A time-lock puzzle is a mechanism for sending messages “to the future”. The sender publishes a puzzle whose solution is the message to be sent, thus hiding it until e...
Mohammad Mahmoody, Tal Moran, Salil P. Vadhan
CPHYSICS
2010
184views more  CPHYSICS 2010»
13 years 7 months ago
Parallel Newton-Krylov-Schwarz algorithms for the three-dimensional Poisson-Boltzmann equation in numerical simulation of colloi
We investigate fully parallel Newton-Krylov-Schwarz (NKS) algorithms for solving the large sparse nonlinear systems of equations arising from the finite element discretization of ...
Feng-Nan Hwang, Shang-Rong Cai, Yun-Long Shao, Jon...
TSP
2012
12 years 3 months ago
Randomized Isometric Linear-Dispersion Space-Time Block Coding for the DF Relay Channel
This article presents a randomized linear-dispersion space-time block code for decode-andforward synchronous relays. The coding matrices are obtained as a set of columns (or rows)...
David Gregoratti, Walid Hachem, Xavier Mestre
JMLR
2012
11 years 10 months ago
Message-Passing Algorithms for MAP Estimation Using DC Programming
We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of...
Akshat Kumar, Shlomo Zilberstein, Marc Toussaint