2107 search results - page 23 / 422 » Computing Small Search Numbers in Linear Time |
118
click to vote
ASIACRYPT
2011
Springer
13 years 11 months ago
2011
Springer
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
3DIM
2005
IEEE
15 years 5 months ago
2005
IEEE
This paper describes a fast, simultaneous alignment method for a large number of range images. Generally the most time-consuming task in aligning range images is searching corresp...
TIT
2008
14 years 11 months ago
2008
Abstract--In linear programming (LP) decoding of a low-density parity-check (LDPC) code one minimizes a linear functional, with coefficients related to log-likelihood ratios, over ...
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
92
Voted
BMCBI
2010
14 years 11 months ago
2010
Background: Large datasets of protein interactions provide a rich resource for the discovery of Short Linear Motifs (SLiMs) that recur in unrelated proteins. However, existing met...