297 search results - page 54 / 60 » On the Decidability of Consistent Query Answering |
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
82
Voted
GRAPHITE
2007
ACM
15 years 1 months ago
2007
ACM
Point-sampled geometry has gained significant interest due to their simplicity. The lack of connectivity touted as a plus, however, creates difficulties in many operations like ge...
110
Voted
ERCIMDL
2010
Springer
14 years 10 months ago
2010
Springer
A well-known challenge of information retrieval is how to infer a user's underlying information need when the input query consists of only a few keywords. Question Answering (...
70
Voted
IJRR
2008
14 years 9 months ago
2008
: We present algorithms for computing all placements of two and three fingers that cage a given polygonal object with n edges in the plane. A polygon is caged when it is impossible...