1095 search results - page 84 / 219 » Preprocessing of Intractable Problems |
106
Voted
PLDI
1995
ACM
1995
ACM
Interprocedural Partial Redundancy Elimination and its Application to Distributed Memory Compilation
15 years 4 months ago
Partial Redundancy Elimination PRE is a general scheme for suppressing partial redundancies which encompasses traditional optimizations like loop invariant code motion and redun...
120
Voted
COMPGEOM
2005
ACM
15 years 2 months ago
2005
ACM
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
114
Voted
WSCG
2004
15 years 2 months ago
2004
This paper presents a new method for realistic real-time rendering of tree foliage. Some approaches to this problem have been presented before but the quality of their results was...
129
Voted
CCCG
2009
15 years 1 months ago
2009
We solve instances of a general class of problems defined as follows: Preprocess a set S of possibly weighted colored geometric objects (e.g. points/orthogonal segments/rectangles...
114
click to vote
ALGORITHMICA
1998
15 years 15 days ago
1998
This short note considers the problem of point location in a Delaunay triangulation of n random points, using no additional preprocessing or storage other than a standard data stru...