Sciweavers

4255 search results - page 171 / 851
» On Learning Boolean Functions
Sort
View
81
Voted
ICCV
2007
IEEE
15 years 4 months ago
Structure from Motion with Missing Data is NP-Hard
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
David Nistér, Fredrik Kahl, Henrik Stew&eac...
SGAI
2004
Springer
15 years 3 months ago
Exploiting Causal Independence in Large Bayesian Networks
The assessment of a probability distribution associated with a Bayesian network is a challenging task, even if its topology is sparse. Special probability distributions based on t...
Rasa Jurgelenaite, Peter J. F. Lucas
76
Voted
ICIP
2003
IEEE
15 years 3 months ago
Effective detection and elimination of impulsive noise with a minimal image smoothing
Impulsive noise filtering is an important problem of image processing. The problem of noise elimination in an image has a companion problem, the problem of maximal preservation of...
Igor N. Aizenberg, Jaakko Astola, Constantine Buta...
FUIN
2008
108views more  FUIN 2008»
14 years 10 months ago
Radial View of Continuous Cellular Automata
Continuous cellular automata (or coupled map lattices) are cellular automata where the state of the cells are real values in [0, 1] and the local transition rule is a real function...
Paola Flocchini, Vladimir Cezar
STTT
2008
90views more  STTT 2008»
14 years 10 months ago
A uniform framework for weighted decision diagrams and its implementation
1 This papers introduces a generic framework for OBDD variants with weighted edges. It covers many boolean and multi-valued OBDD-variants that have been studied in the literature a...
Jörn Ossowski, Christel Baier