256 search results - page 18 / 52 » Short trees in polygons |
SIGMETRICS
2009
ACM
14 years 3 months ago
2009
ACM
Existing empirical studies of Internet structure and path properties indicate that the Internet is tree-like. This work quantifies the degree to which at least two important Inte...
CG
2006
Springer
13 years 8 months ago
2006
Springer
On the classical discrete grid, the analysis of digital straight lines (DSL for short) has been intensively studied for nearly half a century. In this article, we are interested i...
ADCM
2011
13 years 3 months ago
2011
ABSTRACT. In this paper we discuss an abstract iteration scheme for the calculation of the smallest eigenvalue of an elliptic operator eigenvalue problem. A short and geometric pro...
EGH
2010
Springer
13 years 6 months ago
2010
Springer
A ray cast algorithm utilizing a hierarchical acceleration structure needs to perform a tree traversal in the hierarchy. In its basic form, executing the traversal requires a stac...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
An arithmetic read-once formula (ROF for short) is a formula (a circuit whose underlying graph is a tree) in which the operations are {+, ×} and such that every input variable la...