Sciweavers

663 search results - page 8 / 133
» A Parallel Algorithm for Enumerating Combinations
Sort
View
95
Voted
IPPS
2008
IEEE
15 years 8 months ago
Ordered index seed algorithm for intensive DNA sequence comparison
This paper presents a seed-based algorithm for intensive DNA sequence comparison. The novelty comes from the way seeds are used to efficiently generate small ungapped alignments ...
Dominique Lavenier
SPAA
2004
ACM
15 years 7 months ago
Improved combination of online algorithms for acceptance and rejection
Given two admission control algorithms that are cA-acceptcompetitive and cR-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(cA)acce...
David P. Bunde, Yishay Mansour
CTRSA
2011
Springer
243views Cryptology» more  CTRSA 2011»
14 years 5 months ago
Better Key Sizes (and Attacks) for LWE-Based Encryption
We analyze the concrete security and key sizes of theoretically sound lattice-based encryption schemes based on the “learning with errors” (LWE) problem. Our main contribution...
Richard Lindner, Chris Peikert
ISCAS
2006
IEEE
77views Hardware» more  ISCAS 2006»
15 years 8 months ago
A parallel search algorithm for CLNS addition optimization
— We present analytical formulas for the calculation of the memory requirements for a system using the Complex Logarithmic Number System (CLNS). Certain properties of the CLNS ad...
Panagiotis D. Vouzis, Mark G. Arnold
SIGMOD
2002
ACM
172views Database» more  SIGMOD 2002»
16 years 2 months ago
Automating physical database design in a parallel database
Physical database design is important for query performance in a shared-nothing parallel database system, in which data is horizontally partitioned among multiple independent node...
Jun Rao, Chun Zhang, Nimrod Megiddo, Guy M. Lohman