1059 search results - page 15 / 212 » Improved Algorithms via Approximations of Probability Distri... |
100
click to vote
CD
2005
Springer
15 years 5 months ago
2005
Springer
In distributed and mobile environments, the connections among the hosts on which a software system is running are often unstable. As a result of connectivity losses, the overall a...
128
click to vote
APPROX
2000
Springer
15 years 4 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
109
click to vote
CVPR
2004
IEEE
15 years 3 months ago
2004
IEEE
We formulate face localization as a Maximum A Posteriori Probability(MAP) problem of finding the best estimation of human face configuration in a given image. The a prior distribu...
SODA
2008
ACM
15 years 1 months ago
2008
ACM
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
183
click to vote
ICCABS
2011
14 years 3 months ago
2011
—Research efforts to analyze biomolecular properties contribute towards our understanding of biomolecular function. Calculating non-bonded forces (or in our case, electrostatic s...