3875 search results - page 561 / 775 » Approximation algorithms for the 0-extension problem |
178
click to vote
PAMI
2008
15 years 6 months ago
2008
We present an algorithm which provides the one-dimensional subspace where the Bayes error is minimized for the C class problem with homoscedastic Gaussian distributions. Our main ...
179
click to vote
RC
2000
15 years 6 months ago
2000
Conventional plotting programs adopt techniques such as adaptive sampling to approximate, but not to guarantee, correctness and completeness in graphing functions. Moreover, implic...
190
click to vote
IJIG
2002
15 years 6 months ago
2002
This paper proposes a new background subtraction method for detecting moving objects from a time-varied background. While background subtraction has traditionally worked well for ...
203
click to vote
VLDB
2002
ACM
15 years 6 months ago
2002
ACM
The problem of indexing time series has attracted much interest. Most algorithms used to index time series utilize the Euclidean distance or some variation thereof. However, it has...
184
click to vote
RSA
2008
15 years 6 months ago
2008
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...