Sciweavers

885 search results - page 99 / 177
» Optimal Polygon Placement
Sort
View
PLDI
1995
ACM
14 years 1 months ago
Interprocedural Partial Redundancy Elimination and its Application to Distributed Memory Compilation
Partial Redundancy Elimination PRE is a general scheme for suppressing partial redundancies which encompasses traditional optimizations like loop invariant code motion and redun...
Gagan Agrawal, Joel H. Saltz, Raja Das
CONCURRENCY
2000
103views more  CONCURRENCY 2000»
13 years 10 months ago
Cooperating distributed garbage collectors for clusters and beyond
The contribution of this paper is twofold. First a distributed garbage collector (DGC) is presented that is optimized for remote method invocation in reliable networks, such as cu...
Michael Philippsen
ICDE
2000
IEEE
183views Database» more  ICDE 2000»
14 years 11 months ago
Accurate Estimation of the Cost of Spatial Selections
Optimizing queries that involve operations on spatial data requires estimating the selectivity and cost of these operations. In this paper, we focus on estimating the cost of spat...
Ashraf Aboulnaga, Jeffrey F. Naughton
SMI
2006
IEEE
112views Image Analysis» more  SMI 2006»
14 years 4 months ago
ReMESH: An Interactive Environment to Edit and Repair Triangle Meshes
Polygonal meshes obtained from acquisition of real-world objects may easily exhibit topological or geometrical defects, which often prevent subsequent processing and analysis to p...
Marco Attene, Bianca Falcidieno
IWPEC
2004
Springer
14 years 3 months ago
The Minimum Weight Triangulation Problem with Few Inner Points
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
Michael Hoffmann, Yoshio Okamoto