563 search results - page 38 / 113 » Computing approximate PSD factorizations |
87
Voted
ICRA
2006
IEEE
15 years 6 months ago
2006
IEEE
— We consider the problem of path planning above a polyhedral terrain and present a new algorithm that for any p ≥ 1, computes a (c + ε)-approximation to the Lp-shortest path ...
105
click to vote
CPM
2000
Springer
15 years 4 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
MOC
2002
14 years 12 months ago
2002
The Repunit R49081 = (1049081 - 1)/9 is a probable prime. In order to prove primality R49080 must be approximately 33.3% factored. The status of this factorization is included. Rep...
124
click to vote
SODA
2010
ACM
14 years 10 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
TOMS
2011
14 years 7 months ago
2011
Abstract. We present a partitioned algorithm for reducing a symmetric matrix to a tridiagonal form, with partial pivoting. That is, the algorithm computes a factorization P AP T = ...