Sciweavers

1042 search results - page 41 / 209
» Fast Population Coding
Sort
View
CSDA
2004
124views more  CSDA 2004»
13 years 8 months ago
Fast and robust discriminant analysis
The goal of discriminant analysis is to obtain rules that describe the separation between groups of observations. Moreover it allows to classify new observations into one of the k...
Mia Hubert, Katrien van Driessen
SIGIR
2010
ACM
14 years 26 days ago
Self-taught hashing for fast similarity search
The ability of fast similarity search at large scale is of great importance to many Information Retrieval (IR) applications. A promising way to accelerate similarity search is sem...
Dell Zhang, Jun Wang, Deng Cai, Jinsong Lu
ICPR
2004
IEEE
14 years 10 months ago
Fast Robust GA-Based Ellipse Detection
This paper discusses a novel and effective technique for extracting multiple ellipses from an image, using a Multi-Population Genetic Algorithm (MPGA). MPGA evolves a number of su...
Jie Yao, Nawwaf N. Kharma, Peter Grogono
MICCAI
2010
Springer
13 years 7 months ago
Fast and Automatic Heart Isolation in 3D CT Volumes: Optimal Shape Initialization
Abstract. Heart isolation (separating the heart from the proximity tissues, e.g., lung, liver, and rib cage) is a prerequisite to clearly visualize the coronary arteries in 3D. Suc...
Yefeng Zheng, Fernando Vega Higuera, Shaohua Kevin...
FOCS
2002
IEEE
14 years 1 months ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich