394 search results - page 32 / 79 » Computing Minimal Polynomials of Matrices |
105
click to vote
WINE
2009
Springer
15 years 5 months ago
2009
Springer
We consider the complexity of decision making with regards to predatory pricing in multimarket oligopoly models. Specifically, we present multimarket extensions of the classical s...
129
click to vote
STOC
2004
ACM
16 years 24 days ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
100
Voted
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
Point clouds are sets of points in two or three dimensions. Most kernel methods for learning on sets of points have not yet dealt with the specific geometrical invariances and pra...
98
Voted
CGF
2008
15 years 18 days ago
2008
We present a spectral approach to automatically and efficiently obtain discrete free-boundary conformal parameterizations of triangle mesh patches, without the common artifacts du...
ECAI
1998
Springer
15 years 4 months ago
1998
Springer
The problem of minimally modifying a plan in response to changes in the specification of the planning problem has already been investigated in the literature. In this paper we cons...