2475 search results - page 283 / 495 » Question Answering in TREC |
183
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
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...
145
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
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...
190
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
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...
145
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
For a prime p and a vector ¯α = (α1, . . . , αk) ∈ Zk p let f (¯α, p) be the largest n such that in each set A ⊆ Zp of n elements one can find x which has a unique repr...
165
click to vote
IPM
2008
15 years 6 months ago
2008
Access to information via handheld devices supports decision making away from one's computer. However, limitations include small screens and constrained wireless bandwidth. W...