Sciweavers

1389 search results - page 117 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
NIPS
2004
15 years 4 months ago
Incremental Algorithms for Hierarchical Classification
We study the problem of hierarchical classification when labels corresponding to partial and/or multiple paths in the underlying taxonomy are allowed. We introduce a new hierarchi...
Nicolò Cesa-Bianchi, Claudio Gentile, Andre...
ICPR
2010
IEEE
15 years 10 months ago
Integrating a Discrete Motion Model into GMM Based Background Subtraction
GMM based algorithms have become the de facto standard for background subtraction in video sequences, mainly because of their ability to track multiple background distributions, w...
Christian Wolf, Jolion Jolion
IJCAI
1997
15 years 4 months ago
Local Consistency for Ternary Numeric Constraints
We consider algorithms of the Waltz type for computing local consistency (also called arcconsistency) for constraints over numeric domains. Many commonlyused propagationrules do n...
Boi Faltings, Esther Gelle
RANDOM
1998
Springer
15 years 7 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
ICCV
2005
IEEE
15 years 8 months ago
A Unifying Approach to Hard and Probabilistic Clustering
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
Ron Zass, Amnon Shashua