1100 search results - page 119 / 220 » Approximate distance oracles |
83
Voted
APPROX
2008
Springer
15 years 5 days ago
2008
Springer
We study the directed minimum latency problem: given an n-vertex asymmetric metric (V, d) with a root vertex r V , find a spanning path originating at r that minimizes the sum of...
COMPGEOM
2008
ACM
14 years 12 months ago
2008
ACM
Given a fixed origin o in the d-dimensional grid, we give a novel definition of digital rays dig(op) from o to each grid point p. Each digital ray dig(op) approximates the Euclide...
77
Voted
ESANN
2007
14 years 11 months ago
2007
Independent Variable Group Analysis (IVGA) is a method for grouping dependent variables together while keeping mutually independent or weakly dependent variables in separate group...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
91
Voted
ECCC
2008
14 years 10 months ago
2008
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...