Sciweavers

853 search results - page 6 / 171
» Are many small sets explicitly small
Sort
View
ISAAC
2009
Springer
142views Algorithms» more  ISAAC 2009»
14 years 5 months ago
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Core...
IANDC
2008
74views more  IANDC 2008»
13 years 11 months ago
Baire categories on small complexity classes and meager-comeager laws
We introduce two resource-bounded Baire category notions on small complexity classes such as P, QUASIPOLY, SUBEXP and PSPACE and on probabilistic classes such as BPP, which differ...
Philippe Moser
HASE
2008
IEEE
14 years 5 months ago
Small Logs for Transactional Services: Distinction is Much More Accurate than (Positive) Discrimination
For complex services, logging is an integral part of many middleware aspects, especially, transactions and monitoring. In the event of a failure, the log allows us to deduce the c...
Debmalya Biswas, Thomas Gazagnaire, Blaise Genest
ENTCS
2006
113views more  ENTCS 2006»
13 years 11 months ago
Mining Propositional Simplification Proofs for Small Validating Clauses
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
Ian Wehrman, Aaron Stump
CSCW
2006
ACM
14 years 4 months ago
Not all sharing is equal: the impact of a large display on small group collaborative work
Large, shared displays are used in support of many forms of collaborative work and are generally assumed to benefit the work. We investigate this in a qualitative study of an inte...
Stephanie Wilson, Julia Galliers, James Fone