4539 search results - page 618 / 908 » Approaches to Compute Workflow Complexity |
202
click to vote
SCN
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Lattice reduction is known to be a very powerful tool in modern cryptanalysis. In the literature, there are many lattice reduction algorithms that have been proposed with...
156
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
In this paper we propose a framework for gradient descent
image alignment in the Fourier domain. Specifically,
we propose an extension to the classical Lucas & Kanade
(LK) a...
191
click to vote
IPPS
2007
IEEE
16 years 27 days ago
2007
IEEE
Due to the complexity associated with developing parallel applications, scientists and engineers rely on highlevel software libraries such as PETSc, ScaLAPACK and PESSL to ease th...
171
click to vote
EDCC
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. In this paper we present a new modelling approach for dependability evaluation and sensitivity analysis of Scheduled Maintenance Systems, based on a Deterministic and Sto...
168
click to vote
NIPS
2007
15 years 8 months ago
2007
Current computational models of bottom-up and top-down components of attention are predictive of eye movements across a range of stimuli and of simple, fixed visual tasks (such a...