Sciweavers

245 search results - page 38 / 49
» Efficient Solving of Time-dependent Answer Set Programs
Sort
View
MP
2008
135views more  MP 2008»
14 years 11 months ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
16 years 4 days ago
Learning subspace kernels for classification
Kernel methods have been applied successfully in many data mining tasks. Subspace kernel learning was recently proposed to discover an effective low-dimensional subspace of a kern...
Jianhui Chen, Shuiwang Ji, Betul Ceran, Qi Li, Min...
86
Voted
ICC
2007
IEEE
116views Communications» more  ICC 2007»
15 years 3 months ago
Robust Power Allocation for Amplify-and-Forward Relay Networks
Relay power allocation has been shown to provide substantial performance gain in wireless relay networks when perfect global channel state information (CSI) is available. In this p...
Tony Q. S. Quek, Moe Z. Win, Hyundong Shin, Marco ...
CONSTRAINTS
2006
115views more  CONSTRAINTS 2006»
14 years 11 months ago
A Cost-Regular Based Hybrid Column Generation Approach
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
ICML
2008
IEEE
16 years 16 days ago
Training SVM with indefinite kernels
Similarity matrices generated from many applications may not be positive semidefinite, and hence can't fit into the kernel machine framework. In this paper, we study the prob...
Jianhui Chen, Jieping Ye