Sciweavers

7150 search results - page 970 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
ILP
2001
Springer
15 years 11 months ago
Learning Functions from Imperfect Positive Data
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...
Filip Zelezný
IWVF
2001
Springer
15 years 11 months ago
Computational Surface Flattening: A Voxel-Based Approach
Ð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...
Ruth Grossmann, Nahum Kiryati, Ron Kimmel
RT
2001
Springer
15 years 11 months ago
Opacity Shadow Maps
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...
Tae-Yong Kim 0002, Ulrich Neumann
167
Voted
SIGGRAPH
2000
ACM
15 years 11 months ago
Normal meshes
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...
Igor Guskov, Kiril Vidimce, Wim Sweldens, Peter Sc...
ASPDAC
1999
ACM
77views Hardware» more  ASPDAC 1999»
15 years 11 months ago
Timing-Driven Bipartitioning with Replication Using Iterative Quadratic Programming
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
Shihliang Ou, Massoud Pedram