Sciweavers

66 search results - page 6 / 14
» Efficient Matrix Chain Ordering in Polylog Time
Sort
View
NAA
2000
Springer
97views Mathematics» more  NAA 2000»
13 years 10 months ago
Nested-Dissection Orderings for Sparse LU with Partial Pivoting
We describe the implementation and performance of a novel fill-minimization ordering technique for sparse LU factorization with partial pivoting. The technique was proposed by Gilb...
Igor Brainman, Sivan Toledo
TASE
2008
IEEE
13 years 6 months ago
Integrated Supervisory and Operational Control of a Warehouse With a Matrix-Based Approach
This paper considers a matrix-based discrete event control approach for a warehouse. The control system is organized in two modules: a dynamic model and a controller. The model pro...
Vincenzo Giordano, Jing Bing Zhang, David Naso, Fr...
IOR
2008
91views more  IOR 2008»
13 years 6 months ago
A Randomized Quasi-Monte Carlo Simulation Method for Markov Chains
We introduce and study a randomized quasi-Monte Carlo method for estimating the state distribution at each step of a Markov chain. The number of steps in the chain can be random an...
Pierre L'Ecuyer, Christian Lécot, Bruno Tuf...
ICPR
2008
IEEE
14 years 8 months ago
Efficient image inner products applied to active appearance models
This paper introduces a clever way of computing inner products between images in order to drastically reduce the computational complexity of fitting appearance models to images. T...
Jan Erik Solem, Karl Netzell
ICCAD
2004
IEEE
147views Hardware» more  ICCAD 2004»
14 years 3 months ago
Interval-valued reduced order statistical interconnect modeling
9, IO]. However, unlike the case with static timing, it is not so easy We show how recent advances in the handling of correlated interval representations of range uncertainty can b...
James D. Ma, Rob A. Rutenbar