2095 search results - page 52 / 419 » Improved pebbling bounds |
COMPGEOM
2010
ACM
14 years 3 months ago
2010
ACM
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
ENDM
2008
13 years 10 months ago
2008
A generalized configuration is a set of n points and n 2 pseudolines such that each pseudoline passes through exactly two points, two pseudolines intersect exactly once, and no th...
COMBINATORICS
2007
13 years 10 months ago
2007
Let k3(n) denote the minimal cardinality of a ternary code of length n and covering radius one. In this paper we show k3(7) ≥ 156 and k3(8) ≥ 402 improving on the best previou...
JAIR
2010
13 years 8 months ago
2010
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
ASPDAC
2010
ACM
13 years 8 months ago
2010
ACM
Managing long verification error traces is one of the key challenges of automated debugging engines. Today, debuggers rely on the iterative logic array to model sequential behavior...