13214 search results - page 185 / 2643 » Pseudorandomness for network algorithms |
172
click to vote
APIN
2004
15 years 6 months ago
2004
In this paper we present a new technique to simulate polymer blends that overcomes the shortcomings in polymer system modeling. This method has an inherent advantage in that the v...
186
click to vote
IEEECIT
2010
IEEE
15 years 4 months ago
2010
IEEE
Identifying the set of resources that are expected to receive the majority of requests in the near future, namely hot set, is at the basis of most content management strategies of...
146
click to vote
ORL
1998
15 years 6 months ago
1998
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
146
click to vote
HASE
2007
IEEE
16 years 26 days ago
2007
IEEE
We adapt the classic cusum change-point detection algorithm for applications to data network monitoring where various and numerous performance and reliability metrics are availabl...
165
click to vote
UAI
2008
15 years 8 months ago
2008
We introduce a new type of graphical model called a `cumulative distribution network' (CDN), which expresses a joint cumulative distribution as a product of local functions. ...