612 search results - page 58 / 123 » Hardness assumptions in the foundations of theoretical compu... |
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
ISVD
2010
IEEE
13 years 5 months ago
2010
IEEE
An interesting property of the Voronoi tessellation is studied in the context of its application to the analysis of hydration shells in computer simulation of solutions. Namely the...
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
ABSTRACT. We study functionally private approximations. An approximation function g is functionally private with respect to f if, for any input x, g(x) reveals no more information ...
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
ACSC
2005
IEEE
14 years 1 months ago
2005
IEEE
1 Service discovery protocols are used in distributed systems to locate services for clients. The services that are located as well as the clients requesting service are commonly a...