17541 search results - page 101 / 3509 » Complexity in scalable computing |
73
Voted
IJCAI
1997
15 years 1 months ago
1997
Although it is acknowledged that multi-way dataflow constraints are useful in interactive applications, concerns about their tractability have hindered their acceptance. Certain l...
COCOON
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
ECBS
1996
IEEE
15 years 4 months ago
1996
IEEE
It is widely recognized that real-time,fault-tolerant and distributed computing technologies play a key role in the deployment of many current andfuture (civilian or Defense) crit...
127
click to vote
STOC
2000
ACM
15 years 3 months ago
2000
ACM
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
104
click to vote
BMCBI
2006
14 years 12 months ago
2006
Background: Microarray expression profiling has been widely used to identify differentially expressed genes in complex cellular systems. However, while such methods can be used to...