Sciweavers

2570 search results - page 28 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
ISPEC
2010
Springer
15 years 3 months ago
On Fast and Approximate Attack Tree Computations
Abstract. In this paper we address the problem of inefficiency of exact attack tree computations. We propose several implementation-level optimizations and introduce a genetic algo...
Aivo Jürgenson, Jan Willemson
SIGMOD
2004
ACM
166views Database» more  SIGMOD 2004»
15 years 10 months ago
Fast Computation of Database Operations using Graphics Processors
We present new algorithms on commodity graphics processors to perform fast computation of several common database operations. Specifically, we consider operations such as conjunct...
Naga K. Govindaraju, Brandon Lloyd, Wei Wang 0010,...
ISVD
2010
IEEE
14 years 8 months ago
Fast Dynamic Voronoi Treemaps
—The Voronoi Treemap is a space-filling treemap technique that relaxes the constraints of rectangular nodes. Its organic shapes maintain a one-to-one aspect ratio, are flexible...
Avneesh Sud, Danyel Fisher, Huai-Ping Lee
COLING
2002
14 years 9 months ago
A Cheap and Fast Way to Build Useful Translation Lexicons
The paper presents a statistical approach to automatic building of translation lexicons from parallel corpora. We briefly describe the pre-processing steps, a baseline iterative m...
Dan Tufis
COMPGEOM
2000
ACM
15 years 2 months ago
Fast computation of generalized Voronoi diagrams using graphics hardware
: We present a new approach for computing generalized Voronoi diagrams in two and three dimensions using interpolation-based polygon rasterization hardware. The input primitives ma...
Kenneth E. Hoff III, Tim Culver, John Keyser, Ming...