Sciweavers

267 search results - page 39 / 54
» New Algorithms for Efficient High-Dimensional Nonparametric ...
Sort
View
4OR
2005
104views more  4OR 2005»
13 years 8 months ago
The robust shortest path problem with interval data via Benders decomposition
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...
Roberto Montemanni, Luca Maria Gambardella
BMCBI
2006
201views more  BMCBI 2006»
13 years 8 months ago
Gene selection algorithms for microarray data based on least squares support vector machine
Background: In discriminant analysis of microarray data, usually a small number of samples are expressed by a large number of genes. It is not only difficult but also unnecessary ...
E. Ke Tang, Ponnuthurai N. Suganthan, Xin Yao
ICB
2007
Springer
183views Biometrics» more  ICB 2007»
14 years 16 days ago
Robust Point-Based Feature Fingerprint Segmentation Algorithm
Abstract. A critical step in automatic fingerprint recognition is the accurate segmentation of fingerprint images. The objective of fingerprint segmentation is to decide which part...
Chaohong Wu, Sergey Tulyakov, Venu Govindaraju
SIGIR
2008
ACM
13 years 8 months ago
On profiling blogs with representative entries
With an explosive growth of blogs, information seeking in blogosphere becomes more and more challenging. One example task is to find the most relevant topical blogs against a give...
Jinfeng Zhuang, Steven C. H. Hoi, Aixin Sun
CLEIEJ
2008
82views more  CLEIEJ 2008»
13 years 8 months ago
Postal Envelope Segmentation using Learning-Based Approach
This paper presents a learning-based approach to segment postal address blocks where the learning step uses only one pair of images (a sample image and its ideal segmented solutio...
Horacio Andrés Legal-Ayala, Jacques Facon, ...