Sciweavers

2107 search results - page 45 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
ICPR
2002
IEEE
14 years 8 months ago
Radial Projections for Non-Linear Feature Extraction
In this work, two new techniques for non-linear feature extraction are presented. In these techniques, new features are obtained as radial projections of the original measurements...
Alberto J. Pérez Jiménez, Juan Carlo...
ICPR
2006
IEEE
14 years 8 months ago
Fast Support Vector Machine Classification using linear SVMs
We propose a classification method based on a decision tree whose nodes consist of linear Support Vector Machines (SVMs). Each node defines a decision hyperplane that classifies p...
Karina Zapien Arreola, Janis Fehr, Hans Burkhardt
SPAA
1990
ACM
13 years 11 months ago
Analysis of Multithreaded Architectures for Parallel Computing
Multithreading has been proposed as an architectural strategy for tolerating latency in multiprocessors and, through limited empirical studies, shown to offer promise. This paper ...
Rafael H. Saavedra-Barrera, David E. Culler, Thors...
COMPGEOM
2010
ACM
14 years 24 days ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
AUTOMATICA
2011
12 years 11 months ago
Fast computation of minimal elementary decompositions of metabolic flux vectors
The concept of elementary flux vector is valuable in a number of applications of metabolic engineering. For instance, in metabolic flux analysis, each admissible flux vector ca...
Raphaël M. Jungers, Francisca Zamorano, Vince...