Sciweavers

1688 search results - page 160 / 338
» The Complexity of Rationalizing Matchings
Sort
View
BMCV
2000
Springer
15 years 10 months ago
Towards a Computational Model for Object Recognition in IT Cortex
First IEEE International Workshop on Biologically Motivated Computer Vision, Seoul, Korea (May 2000). There is considerable evidence that object recognition in primates is based o...
David G. Lowe
AMW
2009
15 years 7 months ago
Identifying Algebraic Properties to Support Optimization of Unary Similarity Queries
Conventional operators for data retrieval are either based on exact matching or on total order relationship among elements. Neither of them is appropriate to manage complex data, s...
Mônica Ribeiro Porto Ferreira, Agma J. M. Tr...
ICASSP
2010
IEEE
15 years 6 months ago
Gradient Polytope Faces Pursuit for large scale sparse recovery problems
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
Aris Gretsistas, Ivan Damnjanovic, Mark D. Plumble...
NN
1998
Springer
148views Neural Networks» more  NN 1998»
15 years 5 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
ICSE
2009
IEEE-ACM
15 years 3 months ago
Software Assumptions Failure Tolerance: Role, Strategies, and Visions
Abstract. At our behest or otherwise, while our software is being executed, a huge variety of design assumptions is continuously matched with the truth of the current condition. Wh...
Vincenzo De Florio