Sciweavers

303 search results - page 19 / 61
» Discrete Mathematics for Computer Science, Some Notes
Sort
View
STACS
2010
Springer
14 years 3 months ago
Evolving Multialgebras Unify All Usual Sequential Computation Models
Abstract. It is well-known that Abstract State Machines (ASMs) can simulate “stepby-step” any type of machines (Turing machines, RAMs, etc.). We aim to overcome two facts: 1) s...
Serge Grigorieff, Pierre Valarcher
COMPGEOM
2010
ACM
14 years 1 months ago
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
Haim Kaplan, Natan Rubin, Micha Sharir
ACMSE
2005
ACM
14 years 2 months ago
Bibliometric approach to community discovery
Recent research suggests that most of the real-world random networks organize themselves into communities. Communities are formed by subsets of nodes in a graph, which are closely...
Narsingh Deo, Hemant Balakrishnan
IADIS
2008
13 years 10 months ago
Simulation And Other Facilities To Learn Statistics
For several years, some teachers of the Statistics' Department at the University of Cordoba, with some last course of technical Industrial Engineering in Computer science pup...
José Diz Pérez, Manuel Jurado Bello
DFG
2007
Springer
14 years 12 days ago
Why Interval Arithmetic is so Useful
: Interval arithmetic was introduced by Ramon Moore [Moo66] in the 1960s as an approach to bound rounding errors in mathematical computation. The theory of interval analysis emerge...
Younis Hijazi, Hans Hagen, Charles D. Hansen, Kenn...