Sciweavers

539 search results - page 70 / 108
» An Improved Upper Bound for SAT
Sort
View
ICC
2007
IEEE
107views Communications» more  ICC 2007»
14 years 2 months ago
Error Floors of LDPC Coded BICM
Abstract— In recent years performance prediction for communication systems utilizing iteratively decodable codes has been of considerable interest. There have been significant b...
Aditya Ramamoorthy, Nedeljko Varnica
COCOA
2007
Springer
14 years 1 months ago
A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem
Abstract. We present a branch-and-bound (bb) algorithm for the multiple sequence alignment problem (MSA), one of the most important problems in computational biology. The upper bou...
Ernst Althaus, Stefan Canzar
CSR
2007
Springer
14 years 1 months ago
Equivalence Problems for Circuits over Sets of Natural Numbers
We investigate the complexity of equivalence problems for {∪, ∩, − , +, ×}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer an...
Christian Glaßer, Katrin Herr, Christian Rei...
HICSS
2006
IEEE
165views Biometrics» more  HICSS 2006»
14 years 1 months ago
Efficient Algorithms for Batch Re-Keying Operations in Secure Multicast
Secure multicast has a variety of applications in ecommerce, e-banking, command and control, video-ondemand, and other internet-based services. In this paper, we present algorithm...
Mohammad Hossain Heydari, Linda Morales, Ivan Hal ...
ICTCS
2005
Springer
14 years 1 months ago
Faster Deterministic Wakeup in Multiple Access Channels
We consider the fundamental problem of waking up n processors sharing a multiple access channel. We assume the weakest model of synchronization, the locally synchronous model, in ...
Gianluca De Marco, Marco Pellegrini, Giovanni Sbur...