5595 search results - page 983 / 1119 » Approximation Algorithms for Clustering Problems |
175
click to vote
IJACT
2008
15 years 5 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...
135
Voted
SIAMSC
2008
15 years 5 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...
137
Voted
TCS
2008
15 years 5 months ago
2008
We study a problem of scheduling client requests to servers. Each client has a particular latency requirement at each server and may choose either to be assigned to some server in ...
143
click to vote
CAGD
2005
15 years 5 months ago
2005
This paper addresses the point-wise estimation of differential properties of a smooth manifold S--a curve in the plane or a surface in 3D--assuming a point cloud sampled over S is...
148
click to vote
CCE
2004
15 years 5 months ago
2004
A large number of problems in production planning and scheduling, location, transportation, finance, and engineering design require that decisions be made in the presence of uncer...