Sciweavers

1937 search results - page 164 / 388
» Conditioning Probabilistic Databases
Sort
View
CIKM
2006
Springer
15 years 6 months ago
Matching directories and OWL ontologies with AROMA
This paper presents a simple and adaptable matching method dealing with web directories, catalogs and OWL ontologies. By using a well-known Knowledge Discovery in Databases model,...
Jérôme David, Fabrice Guillet, Henri ...
DEXAW
2000
IEEE
149views Database» more  DEXAW 2000»
15 years 7 months ago
On 3D Topological Relationships
This paper presents an integrated study on possible topological relationship between multidimensional simple objects in 0,1,2 and 3 D space. The formal categorisation of spatial r...
Sisi Zlatanova
SP
2009
IEEE
15 years 9 months ago
Exploiting Unix File-System Races via Algorithmic Complexity Attacks
We defeat two proposed Unix file-system race condition defense mechanisms. First, we attack the probabilistic defense mechanism of Tsafrir, et al., published at USENIX FAST 2008[...
Xiang Cai, Yuwei Gui, Rob Johnson
NIPS
2008
15 years 4 months ago
Near-minimax recursive density estimation on the binary hypercube
This paper describes a recursive estimation procedure for multivariate binary densities using orthogonal expansions. For d covariates, there are 2d basis coefficients to estimate,...
Maxim Raginsky, Svetlana Lazebnik, Rebecca Willett...
100
Voted
NIPS
2003
15 years 3 months ago
Sample Propagation
Rao–Blackwellization is an approximation technique for probabilistic inference that flexibly combines exact inference with sampling. It is useful in models where conditioning o...
Mark A. Paskin