Sciweavers

383 search results - page 21 / 77
» A particle filtering framework for randomized optimization a...
Sort
View
ACL
1994
13 years 9 months ago
Optimizing the Computational Lexicalization of Large Grammars
The computational lexicalization of a grammar is the optimization of the links between lexicalized rules and lexical items in order to improve the quality of the bottom-up filteri...
Christian Jacquemin
ICIP
2003
IEEE
14 years 9 months ago
Optimal framework for low bit-rate block coders
Block coders are among the most common compression tools available for still images and video sequences. Their low computational complexity along with their good performance make ...
Yaakov Tsaig, Michael Elad, Gene H. Golub, Peyman ...
ICPR
2004
IEEE
14 years 9 months ago
Large Scale Feature Selection Using Modified Random Mutation Hill Climbing
Feature selection is a critical component of many pattern recognition applications. There are two distinct mechanisms for feature selection, namely the wrapper method and the filt...
Anil K. Jain, Michael E. Farmer, Shweta Bapna
CLUSTER
2008
IEEE
14 years 2 months ago
A comparison of search heuristics for empirical code optimization
—This paper describes the application of various search techniques to the problem of automatic empirical code optimization. The search process is a critical aspect of auto-tuning...
Keith Seymour, Haihang You, Jack Dongarra
GECCO
2003
Springer
415views Optimization» more  GECCO 2003»
14 years 1 months ago
Evolutionary Algorithms for Two Problems from the Calculus of Variations
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
Bryant A. Julstrom