Sciweavers

213 search results - page 9 / 43
» Counting Independent Sets Using the Bethe Approximation
Sort
View
ICALP
2009
Springer
16 years 1 days ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
84
Voted
VLDB
1997
ACM
112views Database» more  VLDB 1997»
15 years 3 months ago
Selectivity Estimation Without the Attribute Value Independence Assumption
The result size of a query that involves multiple attributes from the same relation depends on these attributes’ joint data distribution,i.e., the frequencies of all combination...
Viswanath Poosala, Yannis E. Ioannidis
WABI
2007
Springer
15 years 5 months ago
Topology Independent Protein Structural Alignment
Abstract. Protein structural alignment is an indispensable tool used for many different studies in bioinformatics. Most structural alignment algorithms assume that the structural ...
Joe Dundas, T. Andrew Binkowski, Bhaskar DasGupta,...
RSKT
2010
Springer
14 years 10 months ago
Naive Bayesian Rough Sets
A naive Bayesian classifier is a probabilistic classifier based on Bayesian decision theory with naive independence assumptions, which is often used for ranking or constructing a...
Yiyu Yao, Bing Zhou
IAT
2008
IEEE
15 years 6 months ago
Finding Minimum Data Requirements Using Pseudo-independence
In situations where Bayesian networks (BN) inferencing approximation is allowable, we show how to reduce the amount of sensory observations necessary and in a multi-agent context ...
Yoonheui Kim, Victor R. Lesser