197 search results - page 12 / 40 » Simple deterministic approximation algorithms for counting m... |
DAWAK
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...
SSDBM
2007
IEEE
15 years 4 months ago
2007
IEEE
We present a fast algorithm for computing approximate quantiles in high speed data streams with deterministic error bounds. For data streams of size N where N is unknown in advanc...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract—Existing work on cross-layer optimization for wireless networks adopts simple physical-layer models, i.e., treating interference as noise. In this paper, we adopt a dete...
107
click to vote
ICC
2011
IEEE
13 years 9 months ago
2011
IEEE
—We consider a general wireless channel model for different types of code-division multiple access (CDMA) and space-division multiple-access (SDMA) systems with isometric random ...
INFOCOM
2010
IEEE
14 years 7 months ago
2010
IEEE
On today's high-speed backbone network links, measuring per-flow traffic information has become very challenging. Maintaining exact per-flow packet counters on OC-192 or OC-76...