Sciweavers

7758 search results - page 54 / 1552
» On the Number of Distributive Lattices
Sort
View
DCG
2007
79views more  DCG 2007»
13 years 8 months ago
Distance Measures for Well-Distributed Sets
In this paper we investigate the Erd¨os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We pr...
Alex Iosevich, Michael Rudnev
ICPP
2008
IEEE
14 years 3 months ago
On the Design of Fast Pseudo-Random Number Generators for the Cell Broadband Engine and an Application to Risk Analysis
Numerical simulations in computational physics, biology, and finance, often require the use of high quality and efficient parallel random number generators. We design and optimi...
David A. Bader, Aparna Chandramowlishwaran, Virat ...
ISPA
2005
Springer
14 years 2 months ago
Near Optimal Routing in a Small-World Network with Augmented Local Awareness
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
Jianyang Zeng, Wen-Jing Hsu, Jiangdian Wang
DM
2008
113views more  DM 2008»
13 years 8 months ago
Multivariate Fuss-Catalan numbers
Catalan numbers C(n) = 1 n+1 2n n enumerate binary trees and Dyck paths. The distribution of paths with respect to their number k of factors is given by ballot numbers B(n, k) = n-...
Jean-Christophe Aval
JCT
2007
110views more  JCT 2007»
13 years 8 months ago
Bijective counting of Kreweras walks and loopless triangulations
Abstract. We consider lattice walks in the plane starting at the origin, remaining in the first quadrant i, j ≥ 0 and made of West, South and North-East steps. In 1965, Germain ...
Olivier Bernardi