303 search results - page 52 / 61 » Discrete Mathematics for Computer Science, Some Notes |
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
IFM
2007
Springer
14 years 1 months ago
2007
Springer
Development of computerized embedded control systems is difficult because it brings together systems theory, electrical engineering and computer science. The engineering and analys...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
EBERNBURG
1990
13 years 11 months ago
1990
In the theory of living systems any description of self-organizing processes is confronted by a very central problem concerning the role of the system's boundary, i.e., there...