Sciweavers

6365 search results - page 199 / 1273
» Fast Local Computation Algorithms
Sort
View
SMA
2003
ACM
163views Solid Modeling» more  SMA 2003»
15 years 11 months ago
Fast swept volume approximation of complex polyhedral models
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
Young J. Kim, Gokul Varadhan, Ming C. Lin, Dinesh ...
CVPR
2010
IEEE
16 years 2 months ago
Fast Approximate Energy Minimization with Label Costs
The α-expansion algorithm [4] has had a significant impact in computer vision due to its generality, effectiveness, and speed. Thus far it can only minimize energies that involv...
Andrew Delong, Anton Osokin, Hossam Isack, Yuri Bo...
ECCV
2010
Springer
15 years 7 months ago
Fast Optimization for Mixture Prior Models
Abstract. We consider the minimization of a smooth convex function regularized by the mixture of prior models. This problem is generally difficult to solve even each simpler regula...
Junzhou Huang, Shaoting Zhang, Dimitris N. Metaxas
ANOR
2011
117views more  ANOR 2011»
14 years 10 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
TOG
2008
102views more  TOG 2008»
15 years 6 months ago
Real-time data driven deformation using kernel canonical correlation analysis
Achieving intuitive control of animated surface deformation while observing a specific style is an important but challenging task in computer graphics. Solutions to this task can ...
Wei-Wen Feng, Byung-Uck Kim, Yizhou Yu