8196 search results - page 320 / 1640 » Computational Modeling and Complexity Science |
173
click to vote
BIRTHDAY
2003
Springer
15 years 12 months ago
2003
Springer
The pagination problem of complex documents is in placing text and floating objects on pages in such a way that each object appears close to, but not before, its text reference. ...
147
Voted
TOG
2008
15 years 6 months ago
2008
We present a novel method for procedurally modeling large complex shapes. Our approach is general-purpose and takes as input any 3D polyhedral model provided by a user. The algori...
191
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
168
click to vote
CSR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In 1992, A. Hiltgen [1] provided the first constructions of provably (slightly) secure cryptographic primitives, namely feebly one-way functions. These functions are pro...
199
Voted
MFCS
2001
Springer
15 years 11 months ago
2001
Springer
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview...