Sciweavers

4843 search results - page 379 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
STOC
2007
ACM
117views Algorithms» more  STOC 2007»
16 years 4 months ago
A combinatorial, primal-dual approach to semidefinite programs
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
Sanjeev Arora, Satyen Kale
121
Voted
CEC
2007
IEEE
15 years 11 months ago
The application of evolutionary multi-criteria optimization to dynamic molecular alignment
— This study introduces the multi-criteria approach to the optimization of dynamic molecular alignment by shaped femtosecond laser pulses, which has been considered so far only a...
Ofer M. Shir, Michael Emmerich, Thomas Bäck, ...
116
Voted
IJCNN
2006
IEEE
15 years 10 months ago
Learning to Rank by Maximizing AUC with Linear Programming
— Area Under the ROC Curve (AUC) is often used to evaluate ranking performance in binary classification problems. Several researchers have approached AUC optimization by approxi...
Kaan Ataman, W. Nick Street, Yi Zhang
120
Voted
ISMIS
2005
Springer
15 years 10 months ago
Incremental Collaborative Filtering for Highly-Scalable Recommendation Algorithms
Most recommendation systems employ variations of Collaborative Filtering (CF) for formulating suggestions of items relevant to users’ interests. However, CF requires expensive co...
Manos Papagelis, Ioannis Rousidis, Dimitris Plexou...
IWANN
2005
Springer
15 years 10 months ago
Load Forecasting Using Fixed-Size Least Squares Support Vector Machines
Based on the Nystr¨om approximation and the primal-dual formulation of Least Squares Support Vector Machines (LS-SVM), it becomes possible to apply a nonlinear model to a large sc...
Marcelo Espinoza, Johan A. K. Suykens, Bart De Moo...