Sciweavers

932 search results - page 89 / 187
» Where in the Wikipedia Is That Answer
Sort
View
IJCAI
1989
13 years 10 months ago
Normality and Faults in Logic-Based Diagnosis
Is there one logical de nition of diagnosis? In this paper I argue that the answer to this question is \no". This paper is about the pragmatics of using logic for diagnosis w...
David Poole
DM
2010
83views more  DM 2010»
13 years 9 months ago
Polychromatic colorings of arbitrary rectangular partitions
A general (rectangular) partition is a partition of a rectangle into an arbitrary number of non-overlapping subrectangles. This paper examines vertex colorings using four colors o...
Dániel Gerbner, Balázs Keszegh, Nath...
CC
2006
Springer
125views System Software» more  CC 2006»
13 years 9 months ago
A tight lower bound for restricted pir protocols
We show that any 1-round 2-server Private Information Retrieval Protocol where the answers are 1-bit long must ask questions that are at least n - 2 bits long, which is nearly equa...
Richard Beigel, Lance Fortnow, William I. Gasarch
COMBINATORICS
2006
126views more  COMBINATORICS 2006»
13 years 9 months ago
Bounding the Number of Edges in Permutation Graphs
Given an integer s 0 and a permutation Sn, let ,s be the graph on n vertices {1, . . . , n} where two vertices i < j are adjacent if the permutation flips their order and th...
Peter Keevash, Po-Shen Loh, Benny Sudakov
CORR
2006
Springer
122views Education» more  CORR 2006»
13 years 9 months ago
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
XPath is a simple language for navigating an XML-tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment problem for various frag...
Frank Neven, Thomas Schwentick