4698 search results - page 141 / 940 » Making Functionality More General |
144
Voted
SAC
2006
ACM
15 years 9 months ago
2006
ACM
In a recent work, we have shown that it is not possible to dependably build any type of distributed f fault or intrusiontolerant system under the asynchronous model. This result f...
121
click to vote
ISPD
2000
ACM
15 years 7 months ago
2000
ACM
As technology advances, more and more issues need to be considered in the placement stage, e.g., wirelength, congestion, timing, coupling. It is very hard to consider all of them ...
129
Voted
BMCBI
2010
15 years 3 months ago
2010
Background: Large genomes contain families of highly similar genes that cannot be individually identified by microarray probes. This limitation is due to thermodynamic restriction...
124
click to vote
CTRSA
2008
Springer
15 years 5 months ago
2008
Springer
We motivate and describe the problem of finding protocols for multiparty computations that only use a single broadcast round per computation (latency-free computations). We show t...
143
click to vote
COMBINATORICS
1999
15 years 3 months ago
1999
We find, in the form of a continued fraction, the generating function for the number of (132)-avoiding permutations that have a given number of (123) patterns, and show how to ext...