Sciweavers

1383 search results - page 178 / 277
» On the Complexity of the Interlace Polynomial
Sort
View
IPPS
2003
IEEE
15 years 11 months ago
Master-slave Tasking on Heterogeneous Processors
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are different. We assum...
Pierre-François Dutot
ISCAS
2003
IEEE
172views Hardware» more  ISCAS 2003»
15 years 11 months ago
Efficient symbol synchronization techniques using variable FIR or IIR interpolation filters
Maximum Likelihood estimation theory can be used to develop optimal timing recovery schemes for digital communication systems. Tunable digital interpolation filters are commonly ...
Martin Makundi, Timo I. Laakso
ASIAN
2003
Springer
113views Algorithms» more  ASIAN 2003»
15 years 11 months ago
Global Predicate Detection under Fine-Grained Modalities
Predicate detection is an important problem in distributed systems. Based on the temporal interactions of intervals, there exists a rich class of modalities under which global pred...
Punit Chandra, Ajay D. Kshemkalyani
TAMC
2010
Springer
15 years 11 months ago
Optimal Acceptors and Optimal Proof Systems
Unless we resolve the P vs NP question, we are unable to say whether there is an algorithm (acceptor) that accepts Boolean tautologies in polynomial time and does not accept non-ta...
Edward A. Hirsch
IPPS
2002
IEEE
15 years 11 months ago
Aligning Two Fragmented Sequences
Upon completion of the human and mouse genome sequences, world-wide sequencing capacity will turn to other complex organisms. Current strategies call for many of these genomes to ...
Vamsi Veeramachaneni, Piotr Berman, Webb Miller