608 search results - page 49 / 122 » On Dependent Randomized Rounding Algorithms |
183
click to vote
WDAG
2007
Springer
16 years 20 days ago
2007
Springer
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
154
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
Two infinite 0-1 sequences are called compatible when it is possible to cast out 0's from both in such a way that they become complementary to each other. Answering a question...
159
Voted
NIPS
2007
15 years 8 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 ...
146
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this work, the tracking analysis of the Normalized Least Mean Fourth (NLMF) algorithm is investigated for a random walk channel under very weak assumptions. The novelty of this...
186
click to vote
SIGMOD
2004
ACM
15 years 12 months ago
2004
ACM
Data items are often associated with a location in which they are present or collected, and their relevance or in uence decays with their distance. Aggregate values over such data...