5115 search results - page 353 / 1023 » On Randomized Lanczos Algorithms |
220
click to vote
DCC
2003
IEEE
16 years 7 months ago
2003
IEEE
Nguyen and Shparlinski recently presented a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each s...
169
click to vote
SAT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We offer a new understanding of some aspects of practical SAT-solvers that are based on DPLL with unit-clause propagation, clause-learning, and restarts. On the theoreti...
187
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
Conditional Random Fields (CRFs) are often estimated using an entropy based criterion in combination with Generalized Iterative Scaling (GIS). GIS offers, upon others, the immedi...
172
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
205
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
In DHT-based P2P systems, Replication-based content distribution and load balancing strategies consists of such decisions as which files should be replicated, how many replicas sh...