7930 search results - page 1159 / 1586 » Greedy in Approximation Algorithms |
160
click to vote
CONCUR
2001
Springer
15 years 11 months ago
2001
Springer
In this paper we introduce a static analysis technique for graph transformation systems. We present an algorithm which, given a graph transformation system and a start graph, produ...
175
Voted
ILP
2001
Springer
15 years 11 months ago
2001
Springer
The Bayesian framework of learning from positive noise-free examples derived by Muggleton [12] is extended to learning functional hypotheses from positive examples containing norma...
163
click to vote
IWVF
2001
Springer
15 years 11 months ago
2001
Springer
ÐA voxel-based method for flattening a surface in 3D space into 2D while best preserving distances is presented. Triangulation or polyhedral approximation of the voxel data are no...
182
click to vote
RT
2001
Springer
15 years 11 months ago
2001
Springer
Opacity shadow maps approximate light transmittance inside a complex volume with a set of planar opacity maps. A volume made of standard primitives (points, lines, and polygons) i...
166
click to vote
SIGGRAPH
2000
ACM
15 years 11 months ago
2000
ACM
Normal meshes are new fundamental surface descriptions inspired by differential geometry. A normal mesh is a multiresolution mesh where each level can be written as a normal offse...