3875 search results - page 692 / 775 » Approximation algorithms for the 0-extension problem |
172
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
Markov random field (MRF, CRF) models are popular in
computer vision. However, in order to be computationally
tractable they are limited to incorporate only local interactions
a...
113
click to vote
ICIP
2008
IEEE
15 years 11 months ago
2008
IEEE
Subspace learning techniques are widespread in pattern recognition research. They include PCA, ICA, LPP, etc. These techniques are generally linear and unsupervised. The problem o...
172
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Scientific and intelligence applications have special data handling needs. In these settings, data does not fit the standard model of short coded records that had dominated the dat...
162
click to vote
ICDE
1999
IEEE
15 years 11 months ago
1999
IEEE
Partial periodicity search, i.e., search for partial periodic patterns in time-series databases, is an interesting data mining problem. Previous studies on periodicity search main...
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
Reinforcement Learning methods for controlling stochastic processes typically assume a small and discrete action space. While continuous action spaces are quite common in real-wor...