255 search results - page 33 / 51 » A new upper bound for the bipartite Ramsey problem |
160
click to vote
CRYPTO
2008
Springer
15 years 7 months ago
2008
Springer
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
190
click to vote
TWC
2010
15 years 23 days ago
2010
Abstract-- This paper studies a statistical distribution of instantaneous power in pulse-shaped single-carrier (SC) modulation. Such knowledge is of significant importance to estim...
187
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
161
click to vote
ICALP
2007
Springer
16 years 7 days ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
138
click to vote
UAI
2004
15 years 7 months ago
2004
In this paper, we propose a new lower approximation scheme for POMDP with discounted and average cost criterion. The approximating functions are determined by their values at a fi...