Sciweavers

1171 search results - page 55 / 235
» Variable neighborhood search
Sort
View
CVPR
2011
IEEE
14 years 1 months ago
Compact Hashing with Joint Optimization of Search Accuracy and Time
Similarity search, namely, finding approximate nearest neighborhoods, is the core of many large scale machine learning or vision applications. Recently, many research results dem...
Junfeng He, Regunathan Radhakrishnan, Shih-Fu Chan...
84
Voted
CP
1995
Springer
15 years 1 months ago
Dynamic Variable Ordering in CSPs
Abstract. We investigate the dynamic variable ordering (DVO) technique commonly used in conjunction with tree-search algorithms for solving constraint satisfaction problems. We fi...
Fahiem Bacchus, Paul van Run
74
Voted
CSDA
2006
96views more  CSDA 2006»
14 years 9 months ago
Analysis of new variable selection methods for discriminant analysis
Several methods to select variables that are subsequently used in discriminant analysis are proposed and analysed. The aim is to find from among a set of m variables a smaller sub...
Joaquín A. Pacheco, Silvia Casado, Laura N&...
81
Voted
TASLP
2008
154views more  TASLP 2008»
14 years 9 months ago
Capturing Local Variability for Speaker Normalization in Speech Recognition
The new model reduces the impact of local spectral and temporal variability by estimating a finite set of spectral and temporal warping factors which are applied to speech at the f...
Antonio Miguel, Eduardo Lleida, Richard Rose, Luis...
ECAIW
2000
Springer
15 years 2 months ago
Solving the Sports League Scheduling Problem with Tabu Search
In this paper we present a tabu approach for a version of the Sports League Scheduling Problem. The approach adopted is based on a formulation of the problem as a Constraint Satisf...
Jean-Philippe Hamiez, Jin-Kao Hao