Sciweavers

JACM
2010
51views more  JACM 2010»
13 years 6 months ago
XML with incomplete information
Pablo Barceló, Leonid Libkin, Antonella Pog...
JACM
2010
55views more  JACM 2010»
13 years 6 months ago
Newtonian program analysis
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
JACM
2010
120views more  JACM 2010»
13 years 6 months ago
The structure of inverses in schema mappings
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
Ronald Fagin, Alan Nash
JACM
2010
137views more  JACM 2010»
13 years 10 months ago
Reconciling description logics and rules
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
Boris Motik, Riccardo Rosati
JACM
2010
92views more  JACM 2010»
13 years 10 months ago
Routing betweenness centrality
Shlomi Dolev, Yuval Elovici, Rami Puzis
JACM
2010
104views more  JACM 2010»
13 years 10 months ago
Tight failure detection bounds on atomic object implementations
This article determines the weakest failure detectors to implement shared atomic objects in a distributed system with crash-prone processes. We first determine the weakest failure...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
JACM
2010
111views more  JACM 2010»
13 years 10 months ago
Finding a maximum matching in a sparse random graph in O(n) expected time
We present a linear expected time algorithm for finding maximum cardinality matchings in sparse random graphs. This is optimal and improves on previous results by a logarithmic f...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
JACM
2010
78views more  JACM 2010»
13 years 10 months ago
A discriminative model for semi-supervised learning
Maria-Florina Balcan, Avrim Blum
JACM
2010
135views more  JACM 2010»
13 years 10 months ago
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
Timothy M. Chan