972 search results - page 127 / 195 » Performance of data networks with random links |
192
click to vote
SIGMOD
2002
ACM
16 years 6 months ago
2002
ACM
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
205
click to vote
ICPP
2005
IEEE
15 years 12 months ago
2005
IEEE
Consider a heterogeneous cluster system, consisting of processors with varying processing capabilities and network links with varying bandwidths. Given a DAG application to be sch...
167
click to vote
EDBT
2004
ACM
16 years 6 months ago
2004
ACM
Abstract. Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) ...
207
click to vote
EDBT
2004
ACM
16 years 6 months ago
2004
ACM
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
133
click to vote
INFOCOM
2005
IEEE
15 years 12 months ago
2005
IEEE
— High capacity data transfers over the Internet routinely fail to meet end-to-end performance expectations. The default transport control protocol for best effort data traffic ...