4843 search results - page 179 / 969 » The Shortcut Problem - Complexity and Approximation |
140
click to vote
ICANN
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Trained support vector machines (SVMs) have a slow runtime classification speed if the classification problem is noisy and the sample data set is large. Approximating the...
149
click to vote
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We consider a classic multidimensional generalization of the bin packing problem, namely, packing d-dimensional rectangles into the minimum number of unit cubes. Our two results a...
116
Voted
STOC
2004
ACM
16 years 3 months ago
2004
ACM
The cut-norm ||A||C of a real matrix A = (aij)iR,jS is the maximum, over all I R, J S of the quantity | iI,jJ aij|. This concept plays a major role in the design of efficient app...
110
click to vote
ICIAR
2010
Springer
15 years 8 months ago
2010
Springer
The structural similarity (SSIM) index has been shown to be an useful tool in a wide variety of applications that involve the assessment of image quality and similarity. However, i...
125
click to vote
COMPGEOM
2007
ACM
15 years 7 months ago
2007
ACM
We illustrate a simple algorithm for approximating the medial axis of a 2D shape with smooth boundary from a sample of this boundary. The algorithm is compared to a more general a...