Sciweavers

1208 search results - page 34 / 242
» On Counting Generalized Colorings
Sort
View
ACL
2010
13 years 5 months ago
A Generalized-Zero-Preserving Method for Compact Encoding of Concept Lattices
Constructing an encoding of a concept lattice using short bit vectors allows for efficient computation of join operations on the lattice. Join is the central operation any unifica...
Matthew Skala, Victoria Krakovna, János Kra...
AAAI
2006
13 years 9 months ago
Model Counting: A New Strategy for Obtaining Good Bounds
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
Carla P. Gomes, Ashish Sabharwal, Bart Selman
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
14 years 5 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
ECAI
2006
Springer
13 years 9 months ago
Count-As Conditionals, Classification and Context
Abstract. Searle represents constitutive norms as count-as conditionals, written as `X counts as Y in context C'. Grossi et al. study a class of these conditionals as `in cont...
Guido Boella, Leendert W. N. van der Torre
BMCBI
2007
125views more  BMCBI 2007»
13 years 8 months ago
Statistical tests to compare motif count exceptionalities
Background: Finding over- or under-represented motifs in biological sequences is now a common task in genomics. Thanks to p-value calculation for motif counts, exceptional motifs ...
Stéphane Robin, Sophie Schbath, Vincent Van...