1969 search results - page 231 / 394 » Financial Theory 1 |
150
click to vote
CICLING
2003
Springer
15 years 11 months ago
2003
Springer
A new sort of generative grammar (Sec2) will be demonstrated which is more radically “lexicalist” than any earlier one (Sec1). It is a modified Unification Categorial Gramma...
205
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
188
click to vote
FUN
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
144
click to vote
CIE
2010
Springer
15 years 9 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
169
click to vote
SWAT
2000
Springer
15 years 9 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...