Sciweavers

663 search results - page 8 / 133
» A Parallel Algorithm for Enumerating Combinations
Sort
View
IPPS
2008
IEEE
14 years 1 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
14 years 25 days 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»
12 years 11 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»
14 years 1 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»
14 years 7 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