Sciweavers

501 search results - page 14 / 101
» An Upper Bound on the Number of Rectangulations of a Point S...
Sort
View
AML
2005
73views more  AML 2005»
13 years 7 months ago
Strong reducibility of partial numberings
A strong reducibility relation between partial numberings is introduced which is such that the reduction function transfers exactly the numbers which are indices under the numberin...
Dieter Spreen
DCG
2010
93views more  DCG 2010»
13 years 7 months ago
The Number of Generalized Balanced Lines
Let S be a set of r red points and b = r +2 blue points in general position in the plane. A line determined by them is said to be balanced if in each open half-plane bounded by th...
David Orden, Pedro Ramos, Gelasio Salazar
ECSQARU
2005
Springer
14 years 1 months ago
Consonant Random Sets: Structure and Properties
In this paper, we investigate consonant random sets from the point of view of lattice theory. We introduce a new definition of consonancy and study its relationship with possibili...
Enrique Miranda
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
13 years 5 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...
COMPGEOM
2009
ACM
14 years 2 months ago
An improved bound on the number of unit area triangles
We show that the number of unit-area triangles determined by a set of n points in the plane is O(n9/4+ε), for any ε > 0, improving the recent bound O(n44/19) of Dumitrescu et...
Roel Apfelbaum, Micha Sharir