Sciweavers

7840 search results - page 26 / 1568
» On generalized Ramsey numbers
Sort
View
FPGA
2008
ACM
146views FPGA» more  FPGA 2008»
13 years 10 months ago
FPGA-optimised high-quality uniform random number generators
This paper introduces a method of constructing random number generators from four of the basic primitives provided by FPGAs: Flip-Flips, Lookup-Tables, Shift Registers, and RAMs. ...
David B. Thomas, Wayne Luk
AMC
2010
126views more  AMC 2010»
13 years 9 months ago
On condition numbers of polynomial eigenvalue problems
In this paper, we investigate condition numbers of eigenvalue problems of matrix polynomials with nonsingular leading coefficients, generalizing classical results of matrix pertur...
Nikolaos Papathanasiou, Panayiotis Psarrakos
JC
2007
130views more  JC 2007»
13 years 9 months ago
On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety
We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we first prove that the problem of deciding ...
Peter Scheiblechner
CORR
2007
Springer
99views Education» more  CORR 2007»
13 years 9 months ago
Evolutionary Mesh Numbering: Preliminary Results
Abstract. Mesh numbering is a critical issue in Finite Element Methods, as the computational cost of one analysis is highly dependent on the order of the nodes of the mesh. This pa...
Francis Sourd, Marc Schoenauer
COMGEO
2011
ACM
13 years 4 months ago
On crossing numbers of geometric proximity graphs
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...
Bernardo M. Ábrego, Ruy Fabila Monroy, Silv...