Sciweavers

108 search results - page 12 / 22
» A class of error-correcting pooling designs over complexes
Sort
View
COCO
2010
Springer
152views Algorithms» more  COCO 2010»
13 years 11 months ago
A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
Derrick Stolee, Chris Bourke, N. V. Vinodchandran
VTC
2006
IEEE
14 years 1 months ago
IQ Space Frequency Time Codes for MIMO-OFDM Systems
Abstract: In this paper, we study concatenated coding for MIMOOFDM systems. The proposed concatenated system achieves full spatial and frequency diversity at much lower complexity ...
Samir Al-Ghadhban, R. Michael Buehrer, Brian D. Wo...
EDBTW
2010
Springer
14 years 2 months ago
Updating probabilistic XML
We investigate the complexity of performing updates on probabilistic XML data for various classes of probabilistic XML documents of different succinctness. We consider two elemen...
Evgeny Kharlamov, Werner Nutt, Pierre Senellart
OOPSLA
2007
Springer
14 years 1 months ago
The design and implementation of formal monitoring techniques
In runtime monitoring, a programmer specifies a piece of code to execute when a trace of events occurs during program execution. Previous and related work has shown that runtime m...
Eric Bodden
SIGMOD
2012
ACM
253views Database» more  SIGMOD 2012»
11 years 9 months ago
Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems
The advent of affordable, shared-nothing computing systems portends a new class of parallel database management systems (DBMS) for on-line transaction processing (OLTP) applicatio...
Andrew Pavlo, Carlo Curino, Stanley B. Zdonik