4843 search results - page 186 / 969 » The Shortcut Problem - Complexity and Approximation |
141
click to vote
CAD
2006
Springer
15 years 3 months ago
2006
Springer
Fat conic section and fat conic spline are defined. With well established properties of fat conic splines, the problem of approximating a ruled surface by a tangent smooth cone sp...
137
Voted
DASFAA
2009
IEEE
15 years 10 months ago
2009
IEEE
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...
119
click to vote
IPL
2011
14 years 10 months ago
2011
The segment minimization problem consists of representing an integer matrix as the sum of the fewest number of integer matrices each of which have the property that the non-zeroes...
129
click to vote
FOCS
1999
IEEE
15 years 7 months ago
1999
IEEE
Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They have been used extensively in areas such as computer vision, pattern recog...
142
Voted
ESA
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...