Sciweavers

333 search results - page 19 / 67
» A Unifying Framework for the Analysis of a Class of Euclidea...
Sort
View
DISOPT
2007
155views more  DISOPT 2007»
13 years 7 months ago
Linear-programming design and analysis of fast algorithms for Max 2-CSP
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
Alexander D. Scott, Gregory B. Sorkin
CPAIOR
2006
Springer
13 years 11 months ago
Duality in Optimization and Constraint Satisfaction
We show that various duals that occur in optimization and constraint satisfaction can be classified as inference duals, relaxation duals, or both. We discuss linear programming, su...
John N. Hooker
HIS
2008
13 years 9 months ago
Genetic-Based Synthetic Data Sets for the Analysis of Classifiers Behavior
In this paper, we highlight the use of synthetic data sets to analyze learners behavior under bounded complexity. We propose a method to generate synthetic data sets with a specif...
Núria Macià, Albert Orriols-Puig, Es...
ICML
2009
IEEE
14 years 8 months ago
Generalization analysis of listwise learning-to-rank algorithms
This paper presents a theoretical framework for ranking, and demonstrates how to perform generalization analysis of listwise ranking algorithms using the framework. Many learning-...
Yanyan Lan, Tie-Yan Liu, Zhiming Ma, Hang Li
TASLP
2010
138views more  TASLP 2010»
13 years 2 months ago
Glimpsing IVA: A Framework for Overcomplete/Complete/Undercomplete Convolutive Source Separation
Abstract--Independent vector analysis (IVA) is a method for separating convolutedly mixed signals that significantly reduces the occurrence of the well-known permutation problem in...
Alireza Masnadi-Shirazi, Wenyi Zhang, Bhaskar D. R...