10996 search results - page 307 / 2200 » Future Directions in Computing |
191
click to vote
IJCV
2002
15 years 6 months ago
2002
A novel technique for multi-scale curvature computation on a free-form 3-D surface is presented. This is achieved by convolving local parametrisations of the surface with 2-D Gauss...
162
click to vote
COCOON
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
139
click to vote
COLING
1994
15 years 8 months ago
1994
t This paper describes how recent linguistic results in explaining Japanese short and long distance scram hling (:an be directly incorporated into an existing principles-and-parame...
144
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version)
211
click to vote
ECOOP
1999
Springer
15 years 11 months ago
1999
Springer
We discuss aspects of inlining of virtual method invocations. First, we introduce a new method test to guard inlinings of such invocations, with a di erent set of tradeo s from the...