Sciweavers

496 search results - page 52 / 100
» Machine models and lower bounds for query processing
Sort
View
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
14 years 5 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
SDM
2009
SIAM
164views Data Mining» more  SDM 2009»
14 years 5 months ago
Time-Decayed Correlated Aggregates over Data Streams.
Data stream analysis frequently relies on identifying correlations and posing conditional queries on the data after it has been seen. Correlated aggregates form an important examp...
Graham Cormode, Srikanta Tirthapura, Bojian Xu
CORR
2007
Springer
126views Education» more  CORR 2007»
13 years 7 months ago
Interference and Outage in Clustered Wireless Ad Hoc Networks
—In the analysis of large random wireless networks, the underlying node distribution is almost ubiquitously assumed to be the homogeneous Poisson point process. In this paper, th...
Radha Krishna Ganti, Martin Haenggi
PODS
2007
ACM
109views Database» more  PODS 2007»
14 years 7 months ago
What is "next" in event processing?
Event processing systems have wide applications ranging from managing events from RFID readers to monitoring RSS feeds. Consequently, there exists much work on them in the literat...
Walker M. White, Mirek Riedewald, Johannes Gehrke,...
ECOOP
1998
Springer
13 years 12 months ago
Orthogonal to the Java Imperative
Three nontrivial limitations of the existing JavaT M technology are considered from the viewpoint of object-oriented database technology. The limitations are: lack of support for o...
Suad Alagic, Jose Solorzano, David Gitchell