777 search results - page 117 / 156 » A fast algorithm for the computation of an upper bound on th... |
SPAA
2004
ACM
14 years 2 months ago
2004
ACM
Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...
NAACL
2010
13 years 6 months ago
2010
Typical statistical machine translation systems are trained with static parallel corpora. Here we account for scenarios with a continuous incoming stream of parallel training data...
IACR
2011
12 years 8 months ago
2011
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
ICRA
2007
IEEE
14 years 3 months ago
2007
IEEE
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...