1059 search results - page 48 / 212 » Improved Algorithms via Approximations of Probability Distri... |
269
click to vote
DCOSS
2011
Springer
14 years 6 months ago
2011
Springer
—Given a set of sensor nodes V where each node wants to broadcast a message to all its neighbors that are within a certain broadcasting range, the local broadcasting problem is t...
177
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— The paper investigates theoretical issues in applying the universal swarming technique to efficient content distribution. In a swarming session, a file is distributed...
185
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
160
click to vote
TNN
1998
15 years 6 months ago
1998
— In this work, a probabilistic model is established for recurrent networks. The EM (expectation-maximization) algorithm is then applied to derive a new fast training algorithm f...
165
click to vote
CAV
2007
Springer
15 years 10 months ago
2007
Springer
We present a simple and effective approximated backward reachability algorithm for parameterized systems with existentially and universally quantified global conditions. The indivi...