131 search results - page 18 / 27 » On the Maximum Number of Translates in a Point Set |
SIGMOD
2011
ACM
14 years 8 days ago
2011
ACM
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
131
click to vote
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an i...
PVLDB
2010
14 years 7 months ago
2010
We propose the k-representative regret minimization query (k-regret) as an operation to support multi-criteria decision making. Like top-k, the k-regret query assumes that users h...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
A discretized version of a continuous optimization problem is considered for the case where data is obtained from a set of dispersed sensor nodes and the overall metric is a sum o...
ORL
2008
14 years 9 months ago
2008
By introducing some redundant Klee-Minty constructions, we have previously shown that the central path may visit every vertex of the Klee-Minty cube having 2n - 2 "sharp"...