676 search results - page 100 / 136 » A Search-Free Intersection Algorithm |
98
Voted
DSN
2008
IEEE
15 years 7 months ago
2008
IEEE
Quorums are a basic construct in solving many fundamental distributed computing problems. One of the known ways of making quorums scalable and efficient is by weakening their int...
119
Voted
ICCSA
2007
Springer
15 years 6 months ago
2007
Springer
Next generation of GIS software should be able to manipulate and analyse complex situations of real world phenomena. One of the desired components in such software or system is the...
BMCBI
2008
15 years 17 days ago
2008
Background: Microarray experiments generate vast amounts of data. The functional context of differentially expressed genes can be assessed by querying the Gene Ontology (GO) datab...
99
Voted
DC
2010
15 years 16 days ago
2010
It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform f...
ECCC
2006
15 years 14 days ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...