Sciweavers

70 search results - page 2 / 14
» Optimal reconstruction might be hard
Sort
View
CSB
2005
IEEE
182views Bioinformatics» more  CSB 2005»
13 years 11 months ago
Bacterial Whole Genome Phylogeny Using Proteome Comparison and Optimal Reversal Distance
Traditional phylogenetic tree reconstruction is based on point mutations of a single gene. This approach is hardly suitable for genomes whose genes are almost identical and hardly...
Noppadon Khiripet
DATE
2006
IEEE
110views Hardware» more  DATE 2006»
13 years 11 months ago
Multiprocessor synthesis for periodic hard real-time tasks under a given energy constraint
The energy-aware design for electronic systems has been an important issue in hardware and/or software implementations, especially for embedded systems. This paper targets a synth...
Heng-Ruey Hsu, Jian-Jia Chen, Tei-Wei Kuo
STOC
2007
ACM
111views Algorithms» more  STOC 2007»
14 years 5 months ago
Low-end uniform hardness vs. randomness tradeoffs for AM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
Ronen Shaltiel, Christopher Umans
ISBI
2007
IEEE
13 years 11 months ago
Autocorrecting Reconstruction for Flexible Ct Scanners
Nanotechnology researchers are developing miniature, lowpower x-ray devices. These innovations might revolutionize the world of computed tomography (CT). Tiny x-ray emitters and d...
Jeff Orchard, Alexei Ramotar
ICASSP
2009
IEEE
13 years 12 months ago
A simple, efficient and near optimal algorithm for compressed sensing
When sampling signals below the Nyquist rate, efficient and accurate reconstruction is nevertheless possible, whenever the sampling system is well behaved and the signal is well ...
Thomas Blumensath, Mike E. Davies