Sciweavers

203 search results - page 24 / 41
» On Span Programs
Sort
View
ECOOP
1998
Springer
14 years 2 months ago
Cyclic Distributed Garbage Collection with Group Merger
This paper presents a new algorithm for distributed garbage collection and outlines its implementation within the Network Objects system. The algorithm is based on a reference list...
Helena Rodrigues, Richard E. Jones
ICALP
2010
Springer
13 years 12 months ago
Sparse Reliable Graph Backbones
Given a connected graph G and a failure probability pe for each edge e in G, the reliability of G is the probability that G remains connected when each edge e is removed independe...
Shiri Chechik, Yuval Emek, Boaz Patt-Shamir, David...
PDPTA
2007
13 years 11 months ago
Two Graph Algorithms On an Associative Computing Model
- The MASC (for Multiple Associative Computing) model is a SIMD model enhanced with associative properties and multiple synchronous instruction streams (IS). A number of algorithms...
Mingxian Jin, Johnnie W. Baker
TOMS
2010
106views more  TOMS 2010»
13 years 8 months ago
Computing Tutte Polynomials
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
Gary Haggard, David J. Pearce, Gordon Royle
UIST
2010
ACM
13 years 7 months ago
Soylent: a word processor with a crowd inside
This paper introduces architectural and interaction patterns for integrating crowdsourced human contributions directly into user interfaces. We focus on writing and editing, compl...
Michael S. Bernstein, Greg Little, Robert C. Mille...