534 search results - page 46 / 107 » Efficient polynomial L-approximations |
158
click to vote
TIT
2010
15 years 9 days ago
2010
We consider the problem of rate and power allocation in a multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave ut...
172
Voted
PAMI
2006
15 years 5 months ago
2006
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...
118
click to vote
COLING
2010
15 years 18 days ago
2010
This paper proposes an efficient online method that trains a classifier with many conjunctive features. We employ kernel computation called kernel slicing, which explicitly consid...
143
Voted
MOR
2002
15 years 5 months ago
2002
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
153
click to vote
ISSAC
2009
Springer
16 years 4 days ago
2009
Springer
In this paper, we present an improved method for decomposing multivariate polynomials. This problem, also known as the Functional Decomposition Problem (FDP) [17, 9, 27], is class...