1421 search results - page 181 / 285 » Algorithms for subsequence combinatorics |
123
click to vote
MP
2006
15 years 4 months ago
2006
The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...
222
click to vote
SIAMIS
2010
14 years 11 months ago
2010
Markov random field (MRF) models, including conditional random field models, are popular in computer vision. However, in order to be computationally tractable, they are limited to ...
147
click to vote
KDD
2010
ACM
15 years 8 months ago
2010
ACM
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...
180
click to vote
SOCO
2010
Springer
15 years 2 months ago
2010
Springer
This paper presents an evolutionary algorithm for modeling the arrival dates in time-stamped data sequences such as newscasts, e-mails, IRC conversations, scientific journal artic...
141
click to vote
ECCV
2006
Springer
16 years 6 months ago
2006
Springer
Viola and Jones [VJ] demonstrate that cascade classification methods can successfully detect objects belonging to a single class, such as faces. Detecting and identifying objects t...