Sciweavers

116 search results - page 23 / 24
» Bounds for online bounded space hypercube packing
Sort
View
EDBT
2004
ACM
174views Database» more  EDBT 2004»
14 years 6 months ago
Processing Data-Stream Join Aggregates Using Skimmed Sketches
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...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
FOCS
2009
IEEE
14 years 24 days ago
Dynamic and Non-uniform Pricing Strategies for Revenue Maximization
We consider the Item Pricing problem for revenue maximization in the limited supply setting, where a single seller with n items caters to m buyers with unknown subadditive valuati...
Tanmoy Chakraborty, Zhiyi Huang, Sanjeev Khanna
INFOCOM
2009
IEEE
14 years 21 days ago
Fighting Spam with the NeighborhoodWatch DHT
—In this paper, we present DHTBL, an anti-spam blacklist built upon a novel secure distributed hash table (DHT). We show how DHTBL can be used to replace existing DNS-based black...
Adam Bender, Rob Sherwood, Derek Monner, Nathan Go...
DASFAA
2005
IEEE
157views Database» more  DASFAA 2005»
13 years 11 months ago
Adaptively Detecting Aggregation Bursts in Data Streams
Finding bursts in data streams is attracting much attention in research community due to its broad applications. Existing burst detection methods suffer the problems that 1) the p...
Aoying Zhou, Shouke Qin, Weining Qian
TIT
2002
95views more  TIT 2002»
13 years 5 months ago
On sequential strategies for loss functions with memory
The problem of optimal sequential decision for individual sequences, relative to a class of competing o -line reference strategies, is studied for general loss functions with memo...
Neri Merhav, Erik Ordentlich, Gadiel Seroussi, Mar...