Sciweavers

1688 search results - page 303 / 338
» The Complexity of Rationalizing Matchings
Sort
View
ACISICIS
2008
IEEE
13 years 9 months ago
Efficient Projection for Compressed Sensing
Compressed sensing (CS), a joint compression and sensing process, is a emerging field of activity in which the signal is sampled and simultaneously compressed at a greatly reduced...
Vo Dinh Minh Nhat, Duc Vo, Subhash Challa, Sungyou...
CCS
2008
ACM
13 years 9 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
CF
2005
ACM
13 years 9 months ago
An efficient wakeup design for energy reduction in high-performance superscalar processors
In modern superscalar processors, the complex instruction scheduler could form the critical path of the pipeline stages and limit the clock cycle time. In addition, complex schedu...
Kuo-Su Hsiao, Chung-Ho Chen
NIPS
2007
13 years 9 months ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola
APBC
2004
108views Bioinformatics» more  APBC 2004»
13 years 9 months ago
Ladderlike Stepping and Interval Jumping Searching Algorithms for DNA Sequences
In this study we have designed a novel algorithm for searching common segments in multiple DNA sequences. To improve efficiency in pattern searching, combination of hashing encodi...
Tun-Wen Pai, Margaret Dah-Tsyr Chang, Jia-Han Chu,...