Sciweavers

2440 search results - page 275 / 488
» Data-Intensive Question Answering
Sort
View
AIS
2006
Springer
15 years 5 months ago
Computers and knowledge: a dialogical approach
Artificial intelligence researchers interested in knowledge and in designing and implementing digitized artifacts for representing or sharing knowledge play a crucial role in the ...
Christian Brassac
153
Voted
CC
2006
Springer
125views System Software» more  CC 2006»
15 years 5 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
158
Voted
COMBINATORICS
2006
124views more  COMBINATORICS 2006»
15 years 5 months ago
Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
János Barát, Jirí Matousek, D...
COMBINATORICS
2006
126views more  COMBINATORICS 2006»
15 years 5 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
137views Education» more  CORR 2006»
15 years 5 months ago
Resettable Zero Knowledge in the Bare Public-Key Model under Standard Assumption
In this paper we resolve an open problem regarding resettable zero knowledge in the bare public-key (BPK for short) model: Does there exist constant round resettable zero knowledg...
Yi Deng, Dongdai Lin