563 search results - page 31 / 113 » Computing approximate PSD factorizations |
119
Voted
FSTTCS
2003
Springer
15 years 7 months ago
2003
Springer
Given a polygonal path P with vertices p1, p2, . . . , pn and a real number t ≥ 1, a path Q = (pi1 , pi2 , . . . , pik ) is a t-distance-preserving approximation of P if 1 = i1 &...
104
Voted
IJCAI
2003
15 years 3 months ago
2003
The computation of the first complete approximations of game-theoretic optimal strategies for fullscale poker is addressed. Several abstraction techniques are combined to represe...
123
Voted
ATAL
2007
Springer
15 years 8 months ago
2007
Springer
We present a new method for carrying out state estimation in multiagent settings that are characterized by continuous or large discrete state spaces. State estimation in multiagen...
131
click to vote
STOC
1998
ACM
15 years 6 months ago
1998
ACM
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
108
click to vote
FOCS
1999
IEEE
15 years 6 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...