2980 search results - page 221 / 596 » Computational Geometry |
176
Voted
COMPGEOM
1995
ACM
15 years 8 months ago
1995
ACM
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
127
click to vote
COMPGEOM
1994
ACM
15 years 8 months ago
1994
ACM
We devise techniques to manipulate a collection of loosely interpenetrating spheres in threedimensional space. Our study is motivated by the representation and manipulation of mol...
153
click to vote
COCOA
2008
Springer
15 years 6 months ago
2008
Springer
The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...
155
Voted
ICONIP
2007
15 years 6 months ago
2007
Variational methods for approximate inference in machine learning often adapt a parametric probability distribution to optimize a given objective function. This view is especially ...
119
click to vote
VMV
2008
15 years 6 months ago
2008
In computer graphics, procedural methods and Lsystems are common approaches to model complex botanical trees. In contrast to previous tree modeling systems, we propose linking rul...