Sciweavers

944 search results - page 6 / 189
» A Survey on Counting Networks
Sort
View
BMCBI
2007
125views more  BMCBI 2007»
13 years 7 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...
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 7 months ago
Logical complexity of graphs: a survey
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
Oleg Pikhurko, Oleg Verbitsky
IPPS
1998
IEEE
13 years 11 months ago
An Efficient Counting Network
Counting networks were introduced as a new class of concurrent, distributed, low contention data structures suitable for implementing shared counters. Their structure is similar t...
Costas Busch, Marios Mavronicolas
ADHOC
2007
110views more  ADHOC 2007»
13 years 7 months ago
Hop count based optimization of Bluetooth scatternets
In the past five years Bluetooth scatternets were one of the most promising wireless networking technologies for ad hoc networking. In such networks, mobility together with the f...
Csaba Kiss Kallo, Carla-Fabiana Chiasserini, Sewoo...
SAT
2005
Springer
145views Hardware» more  SAT 2005»
14 years 14 days ago
A New Approach to Model Counting
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...
Wei Wei, Bart Selman