Sciweavers

199 search results - page 24 / 40
» Approximating Center Points with Iterated Radon Points
Sort
View
GW
2005
Springer
119views Biometrics» more  GW 2005»
15 years 11 months ago
Dynamic Control of Captured Motions to Verify New Constraints
Simulating realistic human-like figures is still a challenging task when dynamics is involved. For example, making a virtual human jump to a given position requires to control the...
Carole Durocher, Franck Multon, Richard Kulpa
COMPGEOM
2009
ACM
16 years 10 days ago
PTAS for geometric hitting set problems via local search
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
Nabil H. Mustafa, Saurabh Ray
SIAMSC
2008
139views more  SIAMSC 2008»
15 years 5 months ago
Probing the Pareto Frontier for Basis Pursuit Solutions
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
Ewout van den Berg, Michael P. Friedlander
182
Voted
SIAMJO
2000
108views more  SIAMJO 2000»
15 years 5 months ago
Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
Houyuan Jiang, Daniel Ralph
PG
2007
IEEE
16 years 3 days ago
Precomputed Visibility Cuts for Interactive Relighting with Dynamic BRDFs
This paper presents a novel PRT-based method that uses precomputed visibility cuts for interactive relighting with all-frequency environment maps and arbitrary dynamic BRDFs. Our ...
Oskar Åkerlund, Mattias Unger, Rui Wang