Sciweavers

2421 search results - page 262 / 485
» Approximate Flow-Aware Networking
Sort
View
145
Voted
COMCOM
2008
99views more  COMCOM 2008»
15 years 4 months ago
Performance implications of fluctuating server capacity
In this paper, we consider a variant of an M/M/c/c loss system with fluctuating server capacity. Given a set of primary inputs, such as arrival rate, service rate, and capacity fl...
Jingxiang Luo, Carey L. Williamson
MLDM
2008
Springer
15 years 4 months ago
Distributed Monitoring of Frequent Items
Monitoring frequently occuring items is a recurring task in a variety of applications. Although a number of solutions have been proposed there has been few to address the problem i...
Robert Fuller, Mehmed M. Kantardzic
VLDB
2002
ACM
137views Database» more  VLDB 2002»
15 years 3 months ago
Comparing Data Streams Using Hamming Norms (How to Zero In)
Massive data streams are now fundamental to many data processing applications. For example, Internet routers produce large scale diagnostic data streams. Such streams are rarely s...
Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthu...
PVLDB
2008
116views more  PVLDB 2008»
15 years 3 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan
TITB
2008
204views more  TITB 2008»
15 years 3 months ago
A Cryptographic Approach to Securely Share and Query Genomic Sequences
To support large-scale biomedical research projects, organizations need to share person-specific genomic sequences without violating the privacy of their data subjects. In the past...
Murat Kantarcioglu, Wei Jiang, Ying Liu, Bradley M...