3715 search results - page 491 / 743 » A Space Optimization for FP-Growth |
174
click to vote
IJRR
2010
15 years 4 months ago
2010
Advances in the direct computation of Lyapunov functions using convex optimization make it possible to efficiently evaluate regions of attraction for smooth nonlinear systems. Her...
162
Voted
ANOR
2011
15 years 1 months ago
2011
Abstract The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, br...
191
click to vote
MP
2010
15 years 1 months ago
2010
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minima...
186
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...
132
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper consider the problem of how to evaluate the efficiency of a 3D continuous functional HRTF model in representing measured data. The proposed method is based on Karhunen...