Sciweavers

19 search results - page 2 / 4
» Fast speaker diarization based on binary keys
Sort
View
PKC
2005
Springer
109views Cryptology» more  PKC 2005»
14 years 4 months ago
Fast Multi-computations with Integer Similarity Strategy
Abstract. Multi-computations in finite groups, such as multiexponentiations and multi-scalar multiplications, are very important in ElGamallike public key cryptosystems. Algorithm...
Wu-Chuan Yang, Dah-Jyh Guan, Chi-Sung Laih
EUROGP
2007
Springer
175views Optimization» more  EUROGP 2007»
14 years 5 months ago
Fast Genetic Programming on GPUs
As is typical in evolutionary algorithms, fitness evaluation in GP takes the majority of the computational effort. In this paper we demonstrate the use of the Graphics Processing...
Simon Harding, Wolfgang Banzhaf
CGF
1999
159views more  CGF 1999»
13 years 10 months ago
Fast Polyhedral Cell Sorting for Interactive Rendering of Unstructured Grids
Direct volume rendering based on projective methods works by projecting, in visibility order, the polyhedral cells of a mesh onto the image plane, and incrementally compositing th...
João Comba, James T. Klosowski, Nelson L. M...
ACSAC
2010
IEEE
13 years 9 months ago
Fast and practical instruction-set randomization for commodity systems
Instruction-set randomization (ISR) is a technique based on randomizing the "language" understood by a system to protect it from code-injection attacks. Such attacks wer...
Georgios Portokalidis, Angelos D. Keromytis
EMNLP
2010
13 years 8 months ago
Hashing-Based Approaches to Spelling Correction of Personal Names
We propose two hashing-based solutions to the problem of fast and effective personal names spelling correction in People Search applications. The key idea behind our methods is to...
Raghavendra Udupa, Shaishav Kumar