161 search results - page 30 / 33 » Methods for convex and general quadratic programming |
101
click to vote
STACS
2009
Springer
15 years 5 months ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
WIMOB
2008
IEEE
15 years 5 months ago
2008
IEEE
—We consider the rate allocation problem for data aggregation in wireless sensor networks with two objectives: 1) maximizing the lifetime of a local aggregation cluster and, 2) a...
110
click to vote
KDD
2006
ACM
15 years 11 months ago
2006
ACM
Kernel machines have been shown as the state-of-the-art learning techniques for classification. In this paper, we propose a novel general framework of learning the Unified Kernel ...
COR
2007
14 years 11 months ago
2007
In this paper we apply a heuristic method based on artificial neural networks (NN) in order to trace out the efficient frontier associated to the portfolio selection problem. We...
83
Voted
WWW
2007
ACM
15 years 11 months ago
2007
ACM
This paper is concerned with rank aggregation, the task of combining the ranking results of individual rankers at meta-search. Previously, rank aggregation was performed mainly by...