Sciweavers

3052 search results - page 13 / 611
» Weakly Distributive Domains
Sort
View
ICDCS
1995
IEEE
15 years 4 months ago
Specifying Weak Sets
nt formal speci cations of a new abstraction, weak sets, which can be used to alleviate high latencies when retrieving data from a wide-area information system like the World Wide...
Jeannette M. Wing, David C. Steere
113
Voted
EUROSYS
2009
ACM
15 years 4 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...
114
Voted
DC
2008
15 years 22 days ago
On implementing omega in systems with weak reliability and synchrony assumptions
We study the feasibility and cost of implementing --a fundamental failure detector at the core of many algorithms--in systems with weak reliability and synchrony assumptions. Intui...
Marcos Kawazoe Aguilera, Carole Delporte-Gallet, H...
125
Voted
NIPS
2008
15 years 2 months ago
Semi-supervised Learning with Weakly-Related Unlabeled Data: Towards Better Text Categorization
The cluster assumption is exploited by most semi-supervised learning (SSL) methods. However, if the unlabeled data is merely weakly related to the target classes, it becomes quest...
Liu Yang, Rong Jin, Rahul Sukthankar
119
Voted
APPROX
2004
Springer
179views Algorithms» more  APPROX 2004»
15 years 6 months ago
Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz