1089 search results - page 26 / 218 » Bounds on generalized Frobenius numbers |
COMPGEOM
2010
ACM
15 years 7 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...
111
click to vote
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...
117
click to vote
LCTRTS
2007
Springer
15 years 8 months ago
2007
Springer
In the design of real-time and embedded systems, it is important to establish a bound on the worst-case execution time (WCET) of programs to assure via schedulability analysis tha...
104
click to vote
DM
2008
15 years 2 months ago
2008
Consider a configuration of pebbles distributed on the vertices of a connected graph of order n. A pebbling step consists of removing two pebbles from a given vertex and placing o...
123
click to vote
ISAAC
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...