Sciweavers

844 search results - page 135 / 169
» Solving the p
Sort
View
CG
2008
Springer
14 years 9 months ago
Practical global illumination for interactive particle visualization
Particle-based simulation methods are used to model a wide range of complex phenomena and to solve time-dependent problems of various scales. Effective visualizations of the resul...
Christiaan P. Gribble, Carson Brownlee, Steven G. ...
CORR
2010
Springer
61views Education» more  CORR 2010»
14 years 9 months ago
A weakly stable algorithm for general Toeplitz systems
We show that a fast algorithm for the QR factorization of a Toeplitz or Hankel matrix A is weakly stable in the sense that RT R is close to AT A. Thus, when the algorithm is used ...
Adam W. Bojanczyk, Richard P. Brent, Frank R. de H...
COR
2008
111views more  COR 2008»
14 years 9 months ago
An optimization algorithm for the inventory routing problem with continuous moves
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Martin W. P. Savelsbergh, Jin-Hwa Song
CORR
2010
Springer
188views Education» more  CORR 2010»
14 years 9 months ago
A unified framework for high-dimensional analysis of $M$-estimators with decomposable regularizers
High-dimensional statistical inference deals with models in which the the number of parameters p is comparable to or larger than the sample size n. Since it is usually impossible ...
Sahand Negahban, Pradeep Ravikumar, Martin J. Wain...
EOR
2008
75views more  EOR 2008»
14 years 9 months ago
Soft car sequencing with colors: Lower bounds and optimality proofs
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
Thierry Benoist