Sciweavers

249 search results - page 12 / 50
» Geometry and the complexity of matrix multiplication
Sort
View
DISOPT
2006
155views more  DISOPT 2006»
13 years 9 months ago
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...
Dorit S. Hochbaum, Asaf Levin
COMPGEOM
2011
ACM
13 years 16 days ago
An output-sensitive algorithm for persistent homology
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
Chao Chen, Michael Kerber
CEC
2005
IEEE
14 years 2 months ago
Dynamic niching in evolution strategies with covariance matrix adaptation
Abstract- Evolutionary Algorithms (EAs) have the tendency to converge quickly into a single solution in the search space. However, many complex search problems require the identi...
Ofer M. Shir, Thomas Bäck
TOG
2008
127views more  TOG 2008»
13 years 8 months ago
Hair photobooth: geometric and photometric acquisition of real hairstyles
We accurately capture the shape and appearance of a person's hairstyle. We use triangulation and a sweep with planes of light for the geometry. Multiple projectors and camera...
Sylvain Paris, Will Chang, Oleg I. Kozhushnyan, Wo...
COMPUTING
2006
130views more  COMPUTING 2006»
13 years 9 months ago
Factorized Solution of Lyapunov Equations Based on Hierarchical Matrix Arithmetic
We investigate the numerical solution of large-scale Lyapunov equations with the sign function method. Replacing the usual matrix inversion, addition, and multiplication by format...
Ulrike Baur, Peter Benner