Sciweavers

84 search results - page 1 / 17
» On the Number of Pseudo-Triangulations of Certain Point Sets
Sort
View
CCCG
2003
13 years 8 months ago
On the Number of Pseudo-Triangulations of Certain Point Sets
We pose a monotonicity conjecture on the number of pseudo-triangulations of any planar point set, and check it on two prominent families of point sets, namely the so-called double...
Oswin Aichholzer, David Orden, Francisco Santos, B...
MCS
2010
Springer
13 years 5 months ago
Resolution-stationary random number generators
Besides speed and period length, the quality of uniform random number generators is usually assessed by measuring the uniformity of their point sets, formed by taking vectors of s...
François Panneton, Pierre L'Ecuyer
LICS
1999
IEEE
13 years 11 months ago
First-Order Logic vs. Fixed-Point Logic in Finite Set Theory
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
Albert Atserias, Phokion G. Kolaitis
ORL
2011
12 years 10 months ago
Random half-integral polytopes
We show that half-integral polytopes obtained as the convex hull of a random set of half-integral points of the 0/1 cube have rank as high as Ω(log n/ log log n) with positive pr...
Gábor Braun, Sebastian Pokutta
ALGORITHMICA
2007
145views more  ALGORITHMICA 2007»
13 years 7 months ago
Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...