Sciweavers

1562 search results - page 192 / 313
» Convenience Over Correctness
Sort
View
SIGMOD
2002
ACM
119views Database» more  SIGMOD 2002»
15 years 10 months ago
Rate-based query optimization for streaming information sources
Relational query optimizers have traditionally relied upon table cardinalities when estimating the cost of the query plans they consider. While this approach has been and continue...
Stratis Viglas, Jeffrey F. Naughton
PODS
2007
ACM
196views Database» more  PODS 2007»
15 years 10 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
ICSE
2004
IEEE-ACM
15 years 10 months ago
Efficient Decentralized Monitoring of Safety in Distributed Systems
We describe an efficient decentralized monitoring algorithm that monitors a distributed program's execution to check for violations of safety properties. The monitoring is ba...
Koushik Sen, Abhay Vardhan, Gul Agha, Grigore Rosu
PERCOM
2006
ACM
15 years 9 months ago
A Dynamic Graph Algorithm for the Highly Dynamic Network Problem
A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...
Edwin Soedarmadji, Robert J. McEliece
DCC
2007
IEEE
15 years 9 months ago
High-Rate Analysis of Systematic Lossy Error Protection of a Predictively Encoded Source
We consider a first-order Markov source, which is predictively encoded using a DPCM-style encoder. The quantized compressed prediction residual is transmitted over an erasure chan...
Shantanu Rane, David Rebollo-Monedero, Bernd Girod