Sciweavers

303 search results - page 40 / 61
» Discrete Mathematics for Computer Science, Some Notes
Sort
View
COMPGEOM
2001
ACM
15 years 1 months ago
The convex hull of ellipsoids
The treatment of curved algebraic surfaces becomes more and more the focus of attention in Computational Geometry. We present a video that illustrates the computation of the conve...
Nicola Geismann, Michael Hemmer, Elmar Schöme...
TAMC
2009
Springer
15 years 4 months ago
The Extended Turing Model as Contextual Tool
Computability concerns information with a causal – typically algorithmic – structure. As such, it provides a schematic analysis of many naturally occurring situations. We look ...
S. Barry Cooper
FOCS
2008
IEEE
15 years 4 months ago
Almost-Natural Proofs
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
Timothy Y. Chow
ASM
2004
ASM
15 years 3 months ago
Observations on the Decidability of Transitions
Consider a multiple-agent transition system such that, for some basic types T1, . . . , Tn, the state of any agent can be represented as an element of the Cartesian product T1 ×·...
Yuri Gurevich, Rostislav Yavorskiy
LWA
2008
14 years 11 months ago
Towards the Adaptation of Scientific Course Material powered by Communities of Practice
Several applications support the adaptation of course material. Even though most of these systems allow to specify interaction preferences or even employ user modeling techniques,...
Christine Müller