Sciweavers

4949 search results - page 202 / 990
» Consistency and Set Intersection
Sort
View
126
Voted
CATS
2008
15 years 6 months ago
Well-covered Graphs and Greedoids
G is a well-covered graph provided all its maximal stable sets are of the same size (Plummer, 1970). S is a local maximum stable set of G, and we denote by S (G), if S is a maxim...
Vadim E. Levit, Eugen Mandrescu
ICDCS
2003
IEEE
15 years 10 months ago
Neighbor Table Construction and Update in a Dynamic Peer-to-Peer Network
In a system proposed by Plaxton, Rajaraman and Richa (PRR), the expected cost of accessing a replicated object was proved to be asymptotically optimal for a static set of nodes an...
Huaiyu Liu, Simon S. Lam
ISCA
1998
IEEE
123views Hardware» more  ISCA 1998»
15 years 9 months ago
Weak Ordering - A New Definition
A memory model for a shared memory, multiprocessor commonly and often implicitly assumed by programmers is that of sequential consistency. This model guarantees that all memory ac...
Sarita V. Adve, Mark D. Hill
168
Voted
COLING
2010
15 years 1 days ago
Comparison of different algebras for inducing the temporal structure of texts
This paper investigates the impact of using different temporal algebras for learning temporal relations between events. Specifically, we compare three intervalbased algebras: Alle...
Pascal Denis, Philippe Muller
FOCS
2008
IEEE
15 years 11 months ago
Learning Geometric Concepts via Gaussian Surface Area
We study the learnability of sets in Rn under the Gaussian distribution, taking Gaussian surface area as the “complexity measure” of the sets being learned. Let CS denote the ...
Adam R. Klivans, Ryan O'Donnell, Rocco A. Servedio