Sciweavers

10602 search results - page 56 / 2121
» Weakly Useful Sequences
Sort
View
SPAA
2009
ACM
14 years 4 months ago
Weak graph colorings: distributed algorithms and applications
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...
Fabian Kuhn
EUROSYS
2009
ACM
14 years 1 months ago
Effective and efficient compromise recovery for weakly consistent replication
Weakly consistent replication of data has become increasingly important both for loosely-coupled collections of personal devices and for large-scale infrastructure services. Unfor...
Prince Mahajan, Ramakrishna Kotla, Catherine C. Ma...
BMCBI
2004
90views more  BMCBI 2004»
13 years 9 months ago
Statistical monitoring of weak spots for improvement of normalization and ratio estimates in microarrays
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...
Igor Dozmorov, Nicholas Knowlton, Yuhong Tang, Mic...
EUROCRYPT
2003
Springer
14 years 2 months ago
Resettable Zero-Knowledge in the Weak Public-Key Model
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 ...
Yunlei Zhao, Xiaotie Deng, Chan H. Lee, Hong Zhu
SWAT
2010
Springer
302views Algorithms» more  SWAT 2010»
14 years 2 months ago
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
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...
Imran A. Pirwani, Mohammad R. Salavatipour