2016 search results - page 250 / 404 » Megamaps: Construction and Examples |
155
click to vote
HICSS
1999
IEEE
15 years 11 months ago
1999
IEEE
Empirical work with "Belvedere," a software environment for the construction of diagrammatic representations of evidential relations, is summarized, leading to the hypot...
262
click to vote
ASIACRYPT
1999
Springer
15 years 11 months ago
1999
Springer
This paper presents a weakness in the key schedule of the AES candidate HPC (Hasty Pudding Cipher). It is shown that for the HPC version with a 128-bit key, 1 in 256 keys is weak i...
276
click to vote
GIS
2007
ACM
16 years 7 months ago
2007
ACM
We consider the problem of extracting a river network and a watershed hierarchy from a terrain given as a set of irregularly spaced points. We describe TerraStream, a "pipeli...
174
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
144
click to vote
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
The increasing availability of commodity multicore processors is making parallel computing available to the masses. Traditional parallel languages are largely intended for large-s...