Sciweavers

735 search results - page 118 / 147
» Evaluating Probabilistic Queries over Imprecise Data
Sort
View
PVLDB
2008
116views more  PVLDB 2008»
14 years 11 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan
MICCAI
2010
Springer
14 years 10 months ago
Spatial Decision Forests for MS Lesion Segmentation in Multi-Channel MR Images
Abstract. A new algorithm is presented for the automatic segmentation of Multiple Sclerosis (MS) lesions in 3D MR images. It builds on the discriminative random decision forest fra...
Ezequiel Geremia, Bjoern H. Menze, Olivier Clatz, ...
EDBT
2008
ACM
137views Database» more  EDBT 2008»
15 years 12 months ago
Synthesizing structured text from logical database subsets
In the classical database world, information access has been based on a paradigm that involves structured, schema-aware, queries and tabular answers. In the current environment, h...
Alkis Simitsis, Georgia Koutrika, Yannis Alexandra...
UAI
2008
15 years 1 months ago
Church: a language for generative models
Formal languages for probabilistic modeling enable re-use, modularity, and descriptive clarity, and can foster generic inference techniques. We introduce Church, a universal langu...
Noah Goodman, Vikash K. Mansinghka, Daniel M. Roy,...
SADM
2010
196views more  SADM 2010»
14 years 6 months ago
Bayesian adaptive nearest neighbor
: The k nearest neighbor classification (k-NN) is a very simple and popular method for classification. However, it suffers from a major drawback, it assumes constant local class po...
Ruixin Guo, Sounak Chakraborty