255 search results - page 8 / 51 » Approximate Tree Embedding Problem - An Algebraic Approach |
ICTAI
2003
IEEE
14 years 23 days ago
2003
IEEE
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
CSB
2005
IEEE
14 years 1 months ago
2005
IEEE
Our paper describes the first provably-efficient algorithm for determining protein structures de novo, solely from experimental data. We show how the global nature of a certain ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...
SODA
2000
ACM
13 years 8 months ago
2000
ACM
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
STOC
2005
ACM
14 years 7 months ago
2005
ACM
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...