10602 search results - page 56 / 2121 » Weakly Useful Sequences |
160
click to vote
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
170
click to vote
EUROSYS
2009
ACM
15 years 10 months ago
2009
ACM
Weakly consistent replication of data has become increasingly important both for loosely-coupled collections of personal devices and for large-scale infrastructure services. Unfor...
181
click to vote
BMCBI
2004
15 years 6 months ago
2004
Background: Several aspects of microarray data analysis are dependent on identification of genes expressed at or near the limits of detection. For example, regression-based normal...
159
click to vote
EUROCRYPT
2003
Springer
15 years 11 months ago
2003
Springer
A new public-key model for resettable zero-knowledge (rZK) protocols, which is an extension and generalization of the upper-bounded public-key (UPK) model introduced by Micali and ...
203
click to vote
SWAT
2010
Springer
15 years 11 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...