325 search results - page 60 / 65 » Proofs of Restricted Shuffles |
133
click to vote
CPM
2004
Springer
15 years 11 months ago
2004
Springer
Given a set S = {s1, s2, . . . , sn} of strings each of length m, and an integer L, we study the following two problems. k-Closest Substring problem: find k center strings c1, c2,...
208
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
Concurrent general composition relates to a setting where a secure protocol is run in a network concurrently with other, arbitrary protocols. Clearly, security in such a setting i...
180
click to vote
COCO
2003
Springer
15 years 11 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
186
click to vote
ECCV
2010
Springer
15 years 10 months ago
2010
Springer
In practice, rigid objects often move on a plane. The object then rotates around a fixed axis and translates in a plane orthogonal to this axis. For a concrete example, think of a ...
160
click to vote
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. A Solovay function is a computable upper bound g for prefixfree Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constan...