2252 search results - page 397 / 451 » Lower Bounds for Dynamic Algorithms |
CC
2004
Springer
14 years 2 months ago
2004
Springer
In theory, increasing alias analysis precision should improve compiler optimizations on C programs. This paper compares alias analysis algorithms on scalar optimizations, including...
SIGGRAPH
1996
ACM
14 years 1 months ago
1996
ACM
We present an algorithm for real-time level of detail reduction and display of high-complexity polygonal surface data. The algorithm uses a compact and efficient regular grid repr...
CCCG
1993
13 years 10 months ago
1993
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
CCCG
1994
13 years 10 months ago
1994
We formulate the problem of computing the widest empty corridor with at most ` links and right-angle turns for a set of n points. It is a generalization of the widest empty corrid...
PLDI
2012
ACM
11 years 11 months ago
2012
ACM
JavaScript performance is often bound by its dynamically typed nature. Compilers do not have access to static type information, making generation of efficient, type-specialized m...