Sciweavers

5128 search results - page 289 / 1026
» When Abstraction Fails
Sort
View
SIAMDM
2002
94views more  SIAMDM 2002»
15 years 7 months ago
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
David Peleg, Avishai Wool
229
Voted
TKDE
1998
139views more  TKDE 1998»
15 years 7 months ago
Distributed Optimistic Concurrency Control Methods for High-Performance Transaction Processing
—There is an ever-increasing demand for more complex transactions and higher throughputs in transaction processing systems leading to higher degrees of transaction concurrency an...
Alexander Thomasian
TON
2002
75views more  TON 2002»
15 years 7 months ago
Optimal retrial and timeout strategies for accessing network resources
The notion of timeout (namely, the maximal time to wait before retrying an action) turns up in many networking contexts, such as packet transmission, connection establishment, etc....
Lavy Libman, Ariel Orda
BMCBI
2010
76views more  BMCBI 2010»
15 years 7 months ago
Validation and characterization of DNA microarray gene expression data distribution and associated moments
Background: The data from DNA microarrays are increasingly being used in order to understand effects of different conditions, exposures or diseases on the modulation of the expres...
Reuben Thomas, Luis de la Torre, Xiaoqing Chang, S...
213
Voted
CIKM
2010
Springer
15 years 6 months ago
Automatically suggesting topics for augmenting text documents
We present a method for automated topic suggestion. Given a plain-text input document, our algorithm produces a ranking of novel topics that could enrich the input document in a m...
Robert West, Doina Precup, Joelle Pineau