Sciweavers

3875 search results - page 514 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
IJON
2011
186views more  IJON 2011»
14 years 10 months ago
Discriminative structure selection method of Gaussian Mixture Models with its application to handwritten digit recognition
, Yunde Jia Model structure selection is currently an open problem in modeling data via Gaussian Mixture Models (GMM). This paper proposes a discriminative method to select GMM st...
Xuefeng Chen, Xiabi Liu, Yunde Jia
CVPR
2012
IEEE
13 years 9 months ago
Multiclass pixel labeling with non-local matching constraints
A popular approach to pixel labeling problems, such as multiclass image segmentation, is to construct a pairwise conditional Markov random field (CRF) over image pixels where the...
Stephen Gould
MST
2006
149views more  MST 2006»
15 years 6 months ago
Parameterized Intractability of Distinguishing Substring Selection
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
Jens Gramm, Jiong Guo, Rolf Niedermeier
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
16 years 4 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
AAAI
2012
13 years 9 months ago
Robust Cuts Over Time: Combatting the Spread of Invasive Species with Unreliable Biological Control
Widespread accounts of the harmful effects of invasive species have stimulated both practical and theoretical studies on how the spread of these destructive agents can be containe...
Gwen Spencer