249 search results - page 28 / 50 » Geometry and the complexity of matrix multiplication |
136
click to vote
COMPGEOM
2000
ACM
15 years 10 months ago
2000
ACM
Let A be the incidence matrix of a set system with m sets and n points, m ≤ n, and let t = tr M, where M = AT A. Finally, let σ = tr M2 be the sum of squares of the elements of ...
228
click to vote
COMPGEOM
2011
ACM
14 years 9 months ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
206
Voted
AFRIGRAPH
2010
ACM
15 years 9 months ago
2010
ACM
Interpolation based on Radial Basis Functions (RBF) is very often used for scattered scalar data interpolation in n-dimensional space in general. RBFs are used for surface reconst...
144
Voted
ISAAC
2007
Springer
15 years 11 months ago
2007
Springer
We design a faster algorithm for the k-maximum sub-array problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we achieve O(n3 log ...
162
Voted
WACV
2005
IEEE
15 years 11 months ago
2005
IEEE
— In this work, we present a formalization of the video synchronization problem that exposes new variants of the problem that have been left unexplored to date. We also present a...