489 search results - page 83 / 98 » Approximation Algorithms for the Minimum-Length Corridor and... |
PODS
2009
ACM
14 years 8 months ago
2009
ACM
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
COCO
2003
Springer
14 years 23 days 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 ...
IJACT
2008
13 years 7 months ago
2008
: In Crypto 1997, Goldreich, Goldwasser and Halevi (GGH) proposed a lattice analogue of McEliece public key cryptosystem, in which security is related to the hardness of approximat...
ECML
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...
SIAMSC
2008
13 years 7 months ago
2008
Abstract. We present a new derivative-free algorithm, ORBIT, for unconstrained local optimization of computationally expensive functions. A trust-region framework using interpolati...