932 search results - page 67 / 187 » Uniform Random Number Generators |
TCS
2010
14 years 4 months ago
2010
In this paper we study some relevant prefixes of coloured Motzkin walks (otherwise called coloured Motzkin words). In these walks, the three kinds of step can have , and colours...
101
click to vote
CTRSA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. A redactable signature scheme for a string of objects supports verification even if multiple substrings are removed from the original string. It is important that the re...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...
APPROX
2010
Springer
14 years 11 months ago
2010
Springer
In 2002 Jackson et al. [JKS02] asked whether AC0 circuits augmented with a threshold gate at the output can be efficiently learned from uniform random examples. We answer this ques...
JSAC
2007
14 years 9 months ago
2007
—This paper derives the optimal search time and the optimal search cost that can be achieved in unstructured peer-topeer networks when the demand pattern exhibits clustering (i.e...