Sciweavers

794 search results - page 70 / 159
» Improved algorithms for orienteering and related problems
Sort
View
ESANN
2001
13 years 10 months ago
Learning fault-tolerance in Radial Basis Function Networks
This paper describes a method of supervised learning based on forward selection branching. This method improves fault tolerance by means of combining information related to general...
Xavier Parra, Andreu Català
SODA
2012
ACM
223views Algorithms» more  SODA 2012»
11 years 11 months ago
Data reduction for weighted and outlier-resistant clustering
Statistical data frequently includes outliers; these can distort the results of estimation procedures and optimization problems. For this reason, loss functions which deemphasize ...
Dan Feldman, Leonard J. Schulman
IPPS
1996
IEEE
14 years 1 months ago
Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...
David A. Bader, Joseph JáJá
MICCAI
2007
Springer
14 years 10 months ago
Quality-Based Registration and Reconstruction of Optical Tomography Volumes
Abstract. Ultramicroscopy, a novel optical tomographic imaging modality related to fluorescence microscopy, allows to acquire cross-sectional slices of small specially prepared bio...
Wolfgang Wein, Moritz Blume, Ulrich Leischner, Han...
PRL
2008
122views more  PRL 2008»
13 years 8 months ago
Constraints for closest point finding
The traditional closest point criterion has been widely used for 3D free form shape matching, object recognition, internet search, computer graphics and medical imaging. However, ...
Yonghuai Liu