Sciweavers

1641 search results - page 53 / 329
» Termination Analysis with Algorithmic Learning
Sort
View
COMPGEOM
2009
ACM
15 years 10 months ago
Approximate center points with proofs
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
Gary L. Miller, Donald Sheehy
ICFP
2005
ACM
15 years 9 months ago
Fast narrowing-driven partial evaluation for inductively sequential programs
Narrowing-driven partial evaluation is a powerful technique for the specialization of (first-order) functional and functional logic programs. However, although it gives good resu...
J. Guadalupe Ramos, Josep Silva, Germán Vid...
123
Voted
AI
1999
Springer
15 years 3 months ago
Introspective Multistrategy Learning: On the Construction of Learning Strategies
A central problem in multistrategy learning systems is the selection and sequencing of machine learning algorithms for particular situations. This is typically done by the system ...
Michael T. Cox, Ashwin Ram
145
Voted
MM
2004
ACM
248views Multimedia» more  MM 2004»
15 years 9 months ago
Incremental semi-supervised subspace learning for image retrieval
Subspace learning techniques are widespread in pattern recognition research. They include Principal Component Analysis (PCA), Locality Preserving Projection (LPP), etc. These tech...
Xiaofei He
146
Voted
SIAMMAX
2010
189views more  SIAMMAX 2010»
14 years 10 months ago
Fast Algorithms for the Generalized Foley-Sammon Discriminant Analysis
Linear Discriminant Analysis (LDA) is one of the most popular approaches for feature extraction and dimension reduction to overcome the curse of the dimensionality of the high-dime...
Lei-Hong Zhang, Li-Zhi Liao, Michael K. Ng