Sciweavers

14518 search results - page 363 / 2904
» Two Problems for Sophistication
Sort
View
CVPR
2012
IEEE
13 years 9 months ago
Background modeling using adaptive pixelwise kernel variances in a hybrid feature space
Recent work on background subtraction has shown developments on two major fronts. In one, there has been increasing sophistication of probabilistic models, from mixtures of Gaussi...
Manjunath Narayana, Allen R. Hanson, Erik G. Learn...
ACL
2012
13 years 9 months ago
Fast and Robust Part-of-Speech Tagging Using Dynamic Model Selection
This paper presents a novel way of improving POS tagging on heterogeneous data. First, two separate models are trained (generalized and domain-specific) from the same data set by...
Jinho D. Choi, Martha Palmer
SODA
2000
ACM
125views Algorithms» more  SODA 2000»
15 years 8 months ago
Approximation algorithms for projective clustering
We consider the following two instances of the projective clustering problem: Given a set
Pankaj K. Agarwal, Cecilia Magdalena Procopiuc
CORR
2007
Springer
84views Education» more  CORR 2007»
15 years 6 months ago
Linear versus Non-linear Acquisition of Step-Functions
We address in this paper the following two closely related problems:
Boris Ettinger, Niv Sarig, Yosef Yomdin
175
Voted
ECCV
2006
Springer
16 years 8 months ago
Comparison of Energy Minimization Algorithms for Highly Connected Graphs
Algorithms for discrete energy minimization play a fundamental role for low-level vision. Known techniques include graph cuts, belief propagation (BP) and recently introduced tree-...
Vladimir Kolmogorov, Carsten Rother