Sciweavers

4451 search results - page 810 / 891
» On Random Ordering Constraints
Sort
View
ICALP
2009
Springer
14 years 9 months ago
Algorithms for Secretary Problems on Graphs and Hypergraphs
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
Martin Pál, Nitish Korula
SIGMOD
2009
ACM
180views Database» more  SIGMOD 2009»
14 years 9 months ago
Indexing correlated probabilistic databases
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
Bhargav Kanagal, Amol Deshpande
SIGMOD
2002
ACM
198views Database» more  SIGMOD 2002»
14 years 9 months ago
Processing complex aggregate queries over data streams
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...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
EDBT
2004
ACM
122views Database» more  EDBT 2004»
14 years 9 months ago
Sketch-Based Multi-query Processing over Data Streams
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) ...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
MOBISYS
2006
ACM
14 years 8 months ago
Measurement driven deployment of a two-tier urban mesh access network
Multihop wireless mesh networks can provide Internet access over a wide area with minimal infrastructure expenditure. In this work, we present a measurement driven deployment stra...
Joseph Camp, Joshua Robinson, Christopher Steger, ...