249 search results - page 12 / 50 » Geometry and the complexity of matrix multiplication |
102
click to vote
DISOPT
2006
14 years 12 months ago
2006
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...
117
click to vote
COMPGEOM
2011
ACM
14 years 3 months ago
2011
ACM
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...
CEC
2005
IEEE
15 years 5 months ago
2005
IEEE
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...
TOG
2008
14 years 11 months ago
2008
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...
COMPUTING
2006
14 years 12 months ago
2006
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...