563 search results - page 15 / 113 » Computing approximate PSD factorizations |
142
Voted
PDCAT
2005
Springer
15 years 6 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
126
click to vote
FOCS
2007
IEEE
15 years 7 months ago
2007
IEEE
We show that any deterministic data-stream algorithm that makes a constant number of passes over the input and gives a constant factor approximation of the length of the longest i...
95
Voted
FOCS
2005
IEEE
15 years 6 months ago
2005
IEEE
d Abstract] Mikhail Alekhnovich ∗ Subhash A. Khot † Guy Kindler ‡ Nisheeth K. Vishnoi § We show that, unless NP⊆DTIME(2poly log(n) ), the closest vector problem with pre-...
NIPS
1998
15 years 2 months ago
1998
There has been much recent work on measuring image statistics and on learning probability distributions on images. We observe that the mapping from images to statistics is many-to...
FOSSACS
2007
Springer
15 years 7 months ago
2007
Springer
Desharnais, Gupta, Jagadeesan and Panangaden introduced a family of behavioural pseudometrics for probabilistic transition systems. These pseudometrics are a quantitative analogue ...