Sciweavers

1088 search results - page 64 / 218
» Independence of Negative Constraints
Sort
View
ICDT
2010
ACM
141views Database» more  ICDT 2010»
15 years 2 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
CVPR
2005
IEEE
14 years 11 months ago
Articulated Structure from Motion by Factorization
Multibody affine Structure From Motion (SFM) methods commonly assume independent motion between objects such that the ‘measurement matrix’ has rank 4k. When multiple views ar...
Philip A. Tresadern, Ian D. Reid
ICPR
2008
IEEE
15 years 11 months ago
Efficient image inner products applied to active appearance models
This paper introduces a clever way of computing inner products between images in order to drastically reduce the computational complexity of fitting appearance models to images. T...
Jan Erik Solem, Karl Netzell
ER
2009
Springer
118views Database» more  ER 2009»
15 years 4 months ago
Specifying Valid Compound Terms in Interrelated Faceted Taxonomies
In previous work, we proposed an algebra whose operators allow to specify the valid compound terms of a faceted taxonomy, in a flexible manner (by combining positive and negative ...
Anastasia Analyti, Yannis Tzitzikas, Nicolas Spyra...
IDA
2009
Springer
15 years 4 months ago
Bayesian Robust PCA for Incomplete Data
Abstract. We present a probabilistic model for robust principal component analysis (PCA) in which the observation noise is modelled by Student-t distributions that are independent ...
Jaakko Luttinen, Alexander Ilin, Juha Karhunen