19700 search results - page 3680 / 3940 » DNA-Based Computation Times |
177
click to vote
SPAA
2005
ACM
16 years 8 days ago
2005
ACM
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining...
157
click to vote
AUSAI
2005
Springer
16 years 7 days ago
2005
Springer
All the traditional PCA-based and LDA-based methods are based on the analysis of vectors. So, it is difficult to evaluate the covariance matrices in such a high-dimensional vector ...
190
click to vote
COCO
2005
Springer
16 years 7 days ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
229
click to vote
CONCUR
2005
Springer
16 years 7 days ago
2005
Springer
d Abstract) Vijay Saraswat1 and Radha Jagadeesan2 1 IBM T.J. Watson Research Lab 2 School of CTI, DePaul University Abstract. We present the concurrency and distribution primitives...
172
click to vote
CRYPTO
2005
Springer
16 years 7 days ago
2005
Springer
Broadcast encryption schemes allow a message sender to broadcast an encrypted data so that only legitimate receivers decrypt it. Because of the intrinsic nature of one-to-many comm...