934 search results - page 84 / 187 » A theoretical analysis of the HIFF problem |
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We show that the combinatorial complexity of the union of n infinite cylinders in R3 , having arbitrary radii, is O(n2+ε ), for any ε > 0; the bound is almost tight in the w...
114
click to vote
SIAMJO
2010
14 years 8 months ago
2010
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
170
click to vote
ACMSE
2011
ACM
13 years 10 months ago
2011
ACM
Rising Field Programmable Gate Array (FPGA) market volumes combined with increasing industrial popularity have driven prices down and improved capability to the point that FPGA ha...
SMA
2009
ACM
15 years 4 months ago
2009
ACM
Many algorithms for shape analysis and shape processing rely on accurate estimates of differential information such as normals and curvature. In most settings, however, care must...
129
click to vote
TKDE
2012
13 years 9 days ago
2012
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...