Sciweavers

1220 search results - page 131 / 244
» Restricting grammatical complexity
Sort
View
UAI
2003
13 years 9 months ago
An Empirical Study of w-Cutset Sampling for Bayesian Networks
The paper studies empirically the time-space trade-off between sampling and inference in the cutset sampling algorithm. The algorithm samples over a subset of nodes in a Bayesian ...
Bozhena Bidyuk, Rina Dechter
DMDW
2000
161views Management» more  DMDW 2000»
13 years 9 months ago
View materialization for nested GPSJ queries
View materialization is a central issue in logical design of data warehouses since it is one of the most powerful techniques to improve the response to the workload. Most approach...
Matteo Golfarelli, Stefano Rizzi
APAL
2007
131views more  APAL 2007»
13 years 8 months ago
Bounded fixed-parameter tractability and reducibility
We study a refined framwork of parameterized complexity theory where the parameter dependendence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a fu...
Rod Downey, Jörg Flum, Martin Grohe, Mark Wey...
CORR
2010
Springer
154views Education» more  CORR 2010»
13 years 8 months ago
Causal Markov condition for submodular information measures
The causal Markov condition (CMC) is a postulate that links observations to causality. It describes the conditional independences among the observations that are entailed by a cau...
Bastian Steudel, Dominik Janzing, Bernhard Sch&oum...
JIB
2008
87views more  JIB 2008»
13 years 7 months ago
2.5D Visualisation of Overlapping Biological Networks
Biological data is often structured in the form of complex interconnected networks such as protein interaction and metabolic networks. In this paper, we investigate a new problem ...
David Cho Yau Fung, Seok-Hee Hong, Dirk Koschü...