Sciweavers

56 search results - page 9 / 12
» How good are interior point methods
Sort
View
AAAI
1998
13 years 8 months ago
Fast Probabilistic Modeling for Combinatorial Optimization
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
Shumeet Baluja, Scott Davies
SIGGRAPH
2010
ACM
13 years 12 months ago
Discrete scale axis representations for 3D geometry
This paper addresses the fundamental problem of computing stable medial representations of 3D shapes. We propose a spatially adaptive classification of geometric features that yi...
Balint Miklos, Joachim Giesen, Mark Pauly
WCRE
2010
IEEE
13 years 5 months ago
Understanding Feature Evolution in a Family of Product Variants
Existing software product variants, developed by ad hoc reuse such as copy-paste-modify, are often a starting point for building Software Product Line (SPL). Understanding of how ...
Yinxing Xue, Zhenchang Xing, Stan Jarzabek
CGF
2004
93views more  CGF 2004»
13 years 7 months ago
Instant Volumetric Understanding with Order-Independent Volume Rendering
Rapid, visual understanding of volumetric datasets is a crucial outcome of a good volume rendering application, but few current volume rendering systems deliver this result. Our g...
Benjamin Mora, David S. Ebert
ICPR
2008
IEEE
14 years 8 months ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson