Sciweavers

439 search results - page 36 / 88
» Choiceless Computation and Symmetry
Sort
View
IPCO
2007
108views Optimization» more  IPCO 2007»
14 years 11 months ago
Orbital Branching
We introduce orbital branching, an effective branching method for integer programs containing a great deal of symmetry. The method is based on computing groups of variables that a...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
ICCV
2007
IEEE
15 years 11 months ago
Separating Parts from 2D Shapes using Relatability
It's often important to analyze shapes as made up of parts. But there are two ways to think of how parts fit together. We can characterize the remainder of a shape after a pa...
Xiaofeng Mi, Douglas DeCarlo
COMPUTING
2006
119views more  COMPUTING 2006»
14 years 9 months ago
Sparse Grids, Adaptivity, and Symmetry
Sparse grid methods represent a powerful and efficient technique for the representation and approximation of functions and particularly the solutions of partial differential equat...
Harry Yserentant
CAGD
2008
113views more  CAGD 2008»
14 years 9 months ago
Symmetry of shape charts
For subdivision surfaces, the so-called shape chart can be used to characterize the curvature behavior at an extraordinary point a priori from the initial control net. Of late, it...
Ingo Ginkel, Georg Umlauf
VIS
2004
IEEE
124views Visualization» more  VIS 2004»
15 years 11 months ago
Constrained Inverse Volume Rendering for Planetary Nebulae
Determining the three-dimensional structure of distant astronomical objects is a challenging task, given that terrestrial observations provide only one viewpoint. For this task, b...
Charles D. Hansen, Gordon L. Kindlmann, Marcus A. ...