Sciweavers

164 search results - page 23 / 33
» Adaptive Algorithms for Planar Convex Hull Problems
Sort
View
MP
2006
119views more  MP 2006»
13 years 7 months ago
Approximate extended formulations
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
Mathieu Van Vyve, Laurence A. Wolsey
ICML
2006
IEEE
14 years 8 months ago
The relationship between Precision-Recall and ROC curves
Receiver Operator Characteristic (ROC) curves are commonly used to present results for binary decision problems in machine learning. However, when dealing with highly skewed datas...
Jesse Davis, Mark Goadrich
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
13 years 7 months ago
The Hausdorff Voronoi Diagram of Point Clusters in the Plane
We study the Hausdorff Voronoi diagram of point clusters in the plane, a generalization of Voronoi diagrams based on the Hausdorff distance function. We derive a tight combinatori...
Evanthia Papadopoulou
CORR
2008
Springer
115views Education» more  CORR 2008»
13 years 7 months ago
Adaptive Sum Power Iterative Waterfilling for MIMO Cognitive Radio Channels
Abstract--In this paper, the sum capacity of the Gaussian Multiple Input Multiple Output (MIMO) Cognitive Radio Channel (MCC) is expressed as a convex problem with finite number of...
Rajiv Soundararajan, Sriram Vishwanath
ICASSP
2008
IEEE
14 years 2 months ago
Robust adaptive beamforming using sequential quadratic programming
In this paper, a new algorithm for robust adaptive beamforming is developed. The basic idea of the proposed algorithm is to estimate the difference between the actual and presumed...
Aboulnasr Hassanien, Sergiy A. Vorobyov, Kon Max W...