Sciweavers

2570 search results - page 512 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
15 years 2 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
VISUALIZATION
1999
IEEE
15 years 2 months ago
Splatting Without the Blur
Splatting is a volume rendering algorithm that combines efficient volume projection with a sparse data representation: Only voxels that have values inside the iso-range need to be...
Klaus Mueller, Torsten Möller, Roger Crawfis
VLDB
1999
ACM
151views Database» more  VLDB 1999»
15 years 2 months ago
Cache Conscious Indexing for Decision-Support in Main Memory
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
Jun Rao, Kenneth A. Ross
PLDI
1998
ACM
15 years 2 months ago
Type-Based Alias Analysis
This paper evaluates three alias analyses based on programming language types. The first analysis uses type compatibility to determine aliases. The second extends the first by u...
Amer Diwan, Kathryn S. McKinley, J. Eliot B. Moss
FSE
1994
Springer
134views Cryptology» more  FSE 1994»
15 years 1 months ago
Cryptanalysis of McGuffin
This paper shows that the actual proposal for an unbalanced Feistel network by Schneier and Blaze is as vulnerable to differential cryptanalysis as the DES. 1 McGuffin Schneier and...
Vincent Rijmen, Bart Preneel