699 search results - page 54 / 140 » Generalized Distance Functions in the Theory of Computation |
APAL
2007
14 years 10 months ago
2007
We study a refined framwork of parameterized complexity theory where the parameter dependendence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a fu...
SIGMETRICS
2006
ACM
15 years 3 months ago
2006
ACM
In this paper, we investigate the suitability of embedding Internet hosts into a Euclidean space given their pairwise distances (as measured by round-trip time). Using the classic...
SIGECOM
2008
ACM
14 years 9 months ago
2008
ACM
Often, we wish to design incentive-compatible algorithms for settings in which the players' private information is drawn from discrete domains (e.g., integer values). Our mai...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
194
click to vote
POPL
2008
ACM
15 years 10 months ago
2008
ACM
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...