Sciweavers

611 search results - page 40 / 123
» Index Sets of Computable Structures with Decidable Theories
Sort
View
SPAA
2010
ACM
14 years 23 days ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
COLING
2002
13 years 7 months ago
Effective Structural Inference for Large XML Documents
This paper investigates methods to automatically infer structural information from large XML documents. Using XML as a reference format, we approach the schema generation problem ...
Jason Sankey, Raymond K. Wong
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 8 months ago
Correlated Equilibria in Continuous Games: Characterization and Computation
We present several new characterizations of correlated equilibria in games with continuous utility functions. These have the advantage of being more computationally and analytical...
Noah D. Stein, Pablo A. Parrilo, Asuman E. Ozdagla...
BIRTHDAY
2010
Springer
13 years 5 months ago
Database Theory, Yuri, and Me
Yuri Gurevich made many varied and deep contributions to logic for computer science. Logic provides also the theoretical foundation of database systems. Hence, it is almost unavoid...
Jan Van den Bussche
COMPGEOM
2009
ACM
14 years 2 months ago
Near-linear approximation algorithms for geometric hitting sets
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
Pankaj K. Agarwal, Esther Ezra, Micha Sharir