9 search results - page 1 / 2 » Near-Linear Time Construction of Sparse Neighborhood Covers |
SIAMCOMP
1998
13 years 4 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
PRICAI
2010
Springer
13 years 2 months ago
2010
Springer
Unlike traditional classification tasks, multilabel classification allows a sample to associate with more than one label. This generalization naturally arises the difficulty in cla...
PODS
2002
ACM
14 years 5 months ago
2002
ACM
Data Warehousing and OLAPapplications typically view data as having multiple logical dimensions e.g., product, location with natural hierarchies de ned on each dimension. OLAP que...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
DC
2010
13 years 5 months ago
2010
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...