21324 search results - page 417 / 4265 » Making the case for computing |
127
click to vote
DAM
2006
15 years 6 months ago
2006
In the paper, the computational complexity of several variants of the problem of isothermic DNA sequencing by hybridization, is analyzed. The isothermic sequencing is a recent met...
157
click to vote
JPDC
2006
15 years 6 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
158
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
The fundamental problem of our interest is soft MIMO detection for the case of block fading, i.e., when the transmitted codeword spans over several independent channel realization...
135
click to vote
IICS
2001
Springer
15 years 10 months ago
2001
Springer
In our terminology, a “deliberation” is a distributed collaborative process, more or less spontaneous, structured, and complex. This process can include both individual and col...
158
Voted
SACRYPT
2001
Springer
15 years 10 months ago
2001
Springer
This paper extends the analysis of Pollard’s rho algorithm for solving a single instance of the discrete logarithm problem in a finite cyclic group G to the case of solving more...