Sciweavers

359 search results - page 28 / 72
» The Parameterized Complexity of Counting Problems
Sort
View
NN
1998
Springer
148views Neural Networks» more  NN 1998»
13 years 7 months ago
ARTMAP-IC and medical diagnosis: Instance counting and inconsistent cases
For complex database prediction problems such as medical diagnosis, the ARTMAP-IC neural network adds distributed prediction and category instance counting to the basic fuzzy ARTM...
Gail A. Carpenter, Natalya Markuzon
AAAI
2012
11 years 10 months ago
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda
We extend work by Christian et al. [Review of Economic Design 2007] on lobbying in multiple referenda by first providing a more fine-grained analysis of the computational comple...
Robert Bredereck, Jiehua Chen, Sepp Hartung, Rolf ...
CVPR
2005
IEEE
14 years 9 months ago
Complex 3D Shape Recovery Using a Dual-Space Approach
This paper presents a novel method for reconstructing complex 3D objects with unknown topology using silhouettes extracted from image sequences. This method exploits the duality p...
Chen Liang, Kwan-Yee Kenneth Wong
ICASSP
2008
IEEE
14 years 2 months ago
Parameterized design framework for hardware implementation of particle filters
Particle filtering methods provide powerful techniques for solving non-linear state-estimation problems, and are applied to a variety of application areas in signal processing. Be...
Sankalita Saha, Neal K. Bambha, Shuvra S. Bhattach...
ECCV
2002
Springer
14 years 9 months ago
Robust Parameterized Component Analysis
Principal ComponentAnalysis (PCA) has been successfully applied to construct linear models of shape, graylevel, and motion. In particular, PCA has been widely used to model the var...
Fernando De la Torre, Michael J. Black