2354 search results - page 213 / 471 » Randomness, Stochasticity and Approximations |
150
Voted
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
138
click to vote
NIPS
2007
15 years 6 months ago
2007
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
127
click to vote
PAMI
2002
15 years 4 months ago
2002
We propose a method for choosing the number of colors or true gray levels in an image; this allows fully automatic segmentation of images. Our underlying probability model is a hid...
153
click to vote
PE
2010
Springer
15 years 2 months ago
2010
Springer
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
137
click to vote
SIAMCOMP
2010
15 years 2 months ago
2010
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...