414 search results - page 75 / 83 » On discrete norms of polynomials |
PODC
2006
ACM
14 years 3 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
COMPGEOM
2010
ACM
14 years 2 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
HYBRID
2001
Springer
14 years 2 months ago
2001
Springer
It has been observed that there are a variety of situations in which the most popular hybrid simulation methods can fail to properly detect the occurrence of discrete events. In th...
COMPGEOM
2007
ACM
14 years 1 months ago
2007
ACM
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
COMPGEOM
2005
ACM
13 years 11 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...