Sciweavers

2157 search results - page 133 / 432
» Optimal Fast Hashing
Sort
View
155
Voted
TKDE
2010
159views more  TKDE 2010»
15 years 3 months ago
The Tiled Bitmap Forensic Analysis Algorithm
— Tampering of a database can be detected through the use of cryptographically-strong hash functions. Subsequently-applied forensic analysis algorithms can help determine when, w...
Kyriacos E. Pavlou, Richard T. Snodgrass
FAST
2011
14 years 8 months ago
FAST: Quick Application Launch on Solid-State Drives
Application launch performance is of great importance to system platform developers and vendors as it greatly affects the degree of users’ satisfaction. The single most effectiv...
Yongsoo Joo, Junhee Ryu, Sangsoo Park, Kang G. Shi...
SIAMSC
2010
159views more  SIAMSC 2010»
14 years 11 months ago
The Fast Generalized Gauss Transform
The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points in O(N + M) time. Here, we extend the algorithm to a wider class of kernels, motivated by ...
Marina Spivak, Shravan K. Veerapaneni, Leslie Gree...
EDBT
2006
ACM
255views Database» more  EDBT 2006»
16 years 4 months ago
FIS-by-Step: Visualization of the Fast Index Scan for Nearest Neighbor Queries
Abstract. Many different index structures have been proposed for spatial databases to support efficient query processing. However, most of these index structures suffer from an exp...
Elke Achtert, Dominik Schwald
144
Voted
ICCS
2005
Springer
15 years 10 months ago
Fast Expression Templates
Abstract. Expression templates (ET) can significantly reduce the implementation effort of mathematical software. For some compilers, especially for those of supercomputers, it ca...
Jochen Härdtlein, Alexander Linke, Christoph ...