Sciweavers

242 search results - page 11 / 49
» Provenance for Computational Tasks: A Survey
Sort
View
BMVC
1998
14 years 11 months ago
Choosing an Optimal Neural Network Size to aid a Search Through a Large Image Database
In this paper a fast method of selecting a neural network architecture for pattern recognition tasks is presented. We demonstrate that our proposed method of selecting both input ...
Kieron Messer, Josef Kittler
CJ
2008
90views more  CJ 2008»
14 years 10 months ago
Parameterized Complexity and Biopolymer Sequence Comparison
The article surveys parameterized algorithms and complexities for computational tasks on biopolymer sequences, including the problems of longest common subsequence, shortest commo...
Liming Cai, Xiuzhen Huang, Chunmei Liu, Frances A....
DATE
2009
IEEE
119views Hardware» more  DATE 2009»
15 years 4 months ago
Improved worst-case response-time calculations by upper-bound conditions
Fast real-time feasibility tests and analysis algorithms are necessary for a high acceptance of the formal techniques by industrial software engineers. This paper presents a possi...
Victor Pollex, Steffen Kollmann, Karsten Albers, F...
CVPR
2012
IEEE
13 years 10 days ago
Computing nearest-neighbor fields via Propagation-Assisted KD-Trees
Matching patches between two images, also known as computing nearest-neighbor fields, has been proven a useful technique in various computer vision/graphics algorithms. But this ...
Kaiming He, Jian Sun
AI
2009
Springer
15 years 4 months ago
Grid-Enabled Adaptive Metamodeling and Active Learning for Computer Based Design
Many complex, real world phenomena are difficult to study directly using controlled experiments. Instead, the use of computer simulations has become commonplace as a feasible alte...
Dirk Gorissen