Sciweavers

6409 search results - page 75 / 1282
» A Computational Algorithm for Origami Design
Sort
View
TCSV
2008
195views more  TCSV 2008»
15 years 1 months ago
Locality Versus Globality: Query-Driven Localized Linear Models for Facial Image Computing
Conventional subspace learning or recent feature extraction methods consider globality as the key criterion to design discriminative algorithms for image classification. We demonst...
Yun Fu, Zhu Li, Junsong Yuan, Ying Wu, Thomas S. H...
TIP
1998
129views more  TIP 1998»
15 years 1 months ago
Minimax partial distortion competitive learning for optimal codebook design
— The design of the optimal codebook for a given codebook size and input source is a challenging puzzle that remains to be solved. The key problem in optimal codebook design is h...
Ce Zhu, Lai-Man Po
JCP
2008
162views more  JCP 2008»
15 years 1 months ago
A Hypercube-based Scalable Interconnection Network for Massively Parallel Computing
An important issues in the design of interconnection networks for massively parallel computers is scalability. A new scalable interconnection network topology, called Double-Loop H...
Youyao Liu, Jungang Han, Huimin Du
AGI
2008
15 years 3 months ago
A computational approximation to the AIXI model
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
Sergey Pankov
IPL
2008
93views more  IPL 2008»
15 years 1 months ago
Computing Longest Previous Factor in linear time and applications
We give two optimal linear-time algorithms for computing the Longest Previous Factor (LPF) array corresponding to a string w. For any position i in w, LPF[i] gives the length of th...
Maxime Crochemore, Lucian Ilie