Sciweavers

2570 search results - page 371 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
WG
1993
Springer
15 years 7 months ago
Graphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...
CTRSA
2006
Springer
183views Cryptology» more  CTRSA 2006»
15 years 7 months ago
Efficient Doubling on Genus 3 Curves over Binary Fields
The most important and expensive operation in a hyperelliptic curve cryptosystem (HECC) is scalar multiplication by an integer k, i.e., computing an integer k times a divisor D on ...
Xinxin Fan, Thomas J. Wollinger, Yumin Wang
CVPR
2010
IEEE
15 years 7 months ago
Discontinuous Seam-Carving for Video Retargeting
We introduce a new algorithm for video retargeting that uses discontinuous seam-carving in both space and time for resizing videos. Our algorithm relies on a novel appearance-base...
Matthias Grundmann, Vivek Kwatra, Mei Han, Irfan E...
SAC
2010
ACM
15 years 3 months ago
FANGS: high speed sequence mapping for next generation sequencers
Next Generation Sequencing machines are generating millions of short DNA sequences (reads) everyday. There is a need for efficient algorithms to map these sequences to the referen...
Sanchit Misra, Ramanathan Narayanan, Simon Lin, Al...
122
Voted
ACMSE
2007
ACM
15 years 7 months ago
Chinese remainder theorem based group key management
In this paper, we present two new centralized group key management protocols based on the Chinese Remainder Theorem (CRT). By shifting more computing load onto the key server we o...
Xinliang Zheng, Chin-Tser Huang, Manton M. Matthew...