Sciweavers

67 search results - page 8 / 14
» Empirical Evaluation of Four Tensor Decomposition Algorithms
Sort
View
TIP
2010
161views more  TIP 2010»
13 years 2 months ago
Automatic Parameter Selection for Denoising Algorithms Using a No-Reference Measure of Image Content
Across the field of inverse problems in image and video processing, nearly all algorithms have various parameters which need to be set in order to yield good results. In practice, ...
Xiang Zhu, Peyman Milanfar
AIPS
2010
13 years 9 months ago
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
Hootan Nakhost, Martin Müller 0003
AAAI
2000
13 years 8 months ago
Performance Comparison of Landmark Recognition Systems for Navigating Mobile Robots
Self-localisation is an essential competence for mobile robot navigation. Due to the fundamental unreliability of dead reckoning, a robot must depend on its perception of external...
Tom Duckett, Ulrich Nehmzow
EUROGP
2007
Springer
126views Optimization» more  EUROGP 2007»
13 years 11 months ago
Training Binary GP Classifiers Efficiently: A Pareto-coevolutionary Approach
The conversion and extension of the Incremental Pareto-Coevolution Archive algorithm (IPCA) into the domain of Genetic Programming classification is presented. In particular, the ...
Michal Lemczyk, Malcolm I. Heywood
ICCAD
1999
IEEE
119views Hardware» more  ICCAD 1999»
13 years 11 months ago
Factoring logic functions using graph partitioning
Algorithmic logic synthesis is usually carried out in two stages, the independent stage where logic minimization is performed on the Boolean equations with no regard to physical p...
Martin Charles Golumbic, Aviad Mintz