Sciweavers

719 search results - page 131 / 144
» A Possible World Approach to Uncertain Relational Data
Sort
View
PAMI
2011
13 years 3 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams
CORR
2010
Springer
261views Education» more  CORR 2010»
13 years 5 months ago
Analysis of Quasi-Cyclic LDPC codes under ML decoding over the erasure channel
In this paper, we show that over the binary erasure channel, Quasi-Cyclic LDPC codes can efficiently accommodate the hybrid iterative/ML decoding. We demonstrate that the quasicycl...
Mathieu Cunche, Valentin Savin, Vincent Roca
EDBT
2009
ACM
136views Database» more  EDBT 2009»
14 years 3 months ago
Rule-based multi-query optimization
Data stream management systems usually have to process many long-running queries that are active at the same time. Multiple queries can be evaluated more efficiently together tha...
Mingsheng Hong, Mirek Riedewald, Christoph Koch, J...
SIGMOD
1999
ACM
114views Database» more  SIGMOD 1999»
14 years 22 days ago
A Layered Architecture for Querying Dynamic Web Content
The design of webbases, database systems for supporting Webbased applications, is currently an active area of research. In this paper, we propose a 3-layer architecture for design...
Hasan Davulcu, Juliana Freire, Michael Kifer, I. V...
IDEAS
2003
IEEE
122views Database» more  IDEAS 2003»
14 years 1 months ago
Preferred Repairs for Inconsistent Databases
The objective of this paper is to investigate the problems related to the extensional integration of information sources. In particular, we propose an approach for managing incons...
Sergio Greco, Cristina Sirangelo, Irina Trubitsyna...