Sciweavers

2825 search results - page 383 / 565
» Robust Feature Selection Algorithms
Sort
View
SIGGRAPH
2000
ACM
14 years 1 months ago
Out-of-core simplification of large polygonal models
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
Peter Lindstrom
OPODIS
2003
13 years 11 months ago
Linear Time Byzantine Self-Stabilizing Clock Synchronization
Awareness of the need for robustness in distributed systems increases as distributed systems become an integral part of day-to-day systems. Tolerating Byzantine faults and possessi...
Ariel Daliot, Danny Dolev, Hanna Parnas
AMC
2007
115views more  AMC 2007»
13 years 9 months ago
Evolutionary programming based on non-uniform mutation
Abstract–A new evolutionary programming algorithm (NEP) using the non-uniform mutation operator instead of Gaussian or Cauchy mutation operators is proposed. NEP has the merits o...
Xinchao Zhao, Xiao-Shan Gao, Ze-Chun Hu
PR
2006
120views more  PR 2006»
13 years 9 months ago
Alternative learning vector quantization
In this paper, we discuss the influence of feature vectors contributions at each learning time t on a sequential-type competitive learning algorithm. We then give a learning rate ...
Kuo-Lung Wu, Miin-Shen Yang
ICRA
2010
IEEE
189views Robotics» more  ICRA 2010»
13 years 8 months ago
Affordable SLAM through the co-design of hardware and methodology
— Simultaneous localization and mapping (SLAM) is a prominent feature for autonomous robots operating in undefined environments. Applications areas such as consumer robotics app...
Stéphane Magnenat, Valentin Longchamp, Mich...