4843 search results - page 93 / 969 » The Shortcut Problem - Complexity and Approximation |
ISMIR
2004
Springer
15 years 3 months ago
2004
Springer
In this paper, an application of feature extraction from music data is first introduced to motivate our research of finding approximate repeating patterns from sequence data. An a...
MOC
1998
14 years 9 months ago
1998
A general method for near-best approximations to functionals on Rd, using scattered-data information is discussed. The method is actually the moving least-squares method, presented...
CSCLP
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
WAOA
2007
Springer
15 years 4 months ago
2007
Springer
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
ISAAC
2000
Springer
15 years 1 months ago
2000
Springer
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...