2107 search results - page 58 / 422 » Computing Small Search Numbers in Linear Time |
146
Voted
AP2PS
2009
IEEE
15 years 5 months ago
2009
IEEE
—P2P computing platforms are subject to a wide range of attacks. In this paper, we propose a generalisation of the previous disk-less checkpointing approach for fault-tolerance i...
117
click to vote
CSB
2003
IEEE
15 years 7 months ago
2003
IEEE
Reverse-engineering of gene networks using linear models often results in an underdetermined system because of excessive unknown parameters. In addition, the practical utility of ...
101
Voted
IMA
1995
Springer
15 years 6 months ago
1995
Springer
An algorithm for finding small-weight words in large linear codes is developed and a precise analysis of its complexity is given. It is in particular able to decode random [512,256...
117
Voted
INFOCOM
2005
IEEE
15 years 8 months ago
2005
IEEE
— We study hybrid search schemes for unstructured peer-to-peer networks. We quantify performance in terms of number of hits, network overhead, and response time. Our schemes comb...
116
Voted
ETS
2006
IEEE
15 years 8 months ago
2006
IEEE
A central problem in built-in self test (BIST) is how to efficiently generate a small set of test vectors that detect all targeted faults. We propose a novel solution that uses l...