SODA
2012
ACM
12 years 6 months ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
ICDE
2012
IEEE
12 years 6 months ago
2012
IEEE
—On a stream of two dimensional data items (x, y) where x is an item identifier, and y is a numerical attribute, a correlated aggregate query requires us to first apply a selec...
APPROX
2011
Springer
13 years 4 months ago
2011
Springer
We consider the problem of identifying periodic trends in data streams. We say a signal a ∈ Rn is p-periodic if ai = ai+p for all i ∈ [n − p]. Recently, Erg¨un et al. [4] pr...
TCS
2010
14 years 2 months ago
2010
We give an O(n2 m + nm2 + m2 log m) time and O(n2 + m2 ) space algorithm for finding the shortest traveling salesman tour through the vertices of two simple polygonal obstacles i...
DCG
2008
14 years 4 months ago
2008
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyperplanes of maximum regression depth among a set of n points. We work primarily...