Sciweavers

1089 search results - page 13 / 218
» Bounds on generalized Frobenius numbers
Sort
View
ICFP
2004
ACM
14 years 7 months ago
Numbering matters: first-order canonical forms for second-order recursive types
We study a type system equipped with universal types and equirecursive types, which we refer to as F?. We show that type equality may be decided in time O(n log n), an improvement...
François Pottier, Nadji Gauthier
CCCG
2004
13 years 9 months ago
On the number of line tangents to four triangles in three-dimensional space
We establish upper and lower bounds on the number of connected components of lines tangent to four triangles in R3 . We show that four triangles in R3 may admit at least 88 tangent...
Hervé Brönnimann, Olivier Devillers, S...
IPCO
2007
126views Optimization» more  IPCO 2007»
13 years 9 months ago
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
René Beier, Heiko Röglin, Berthold V&o...
ECCC
2010
87views more  ECCC 2010»
13 years 5 months ago
Testing monotonicity of distributions over general partial orders
We investigate the number of samples required for testing the monotonicity of a distribution with respect to an arbitrary underlying partially ordered set. Our first result is a n...
Arnab Bhattacharyya, Eldar Fischer, Ronitt Rubinfe...
COMGEO
2011
ACM
13 years 2 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...