4865 search results - page 157 / 973 » The Complexity of Graph Connectivity |
145
Voted
AAAI
2011
14 years 3 months ago
2011
In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...
93
Voted
APAL
2008
15 years 3 months ago
2008
We show that for random bit strings, Up(n), with probability, p = 1 2 , the firstorder quantifier depth D(Up(n)) needed to distinguish non-isomorphic structures is (lg lg n), with...
130
click to vote
IWCMC
2006
ACM
15 years 9 months ago
2006
ACM
One important characteristic of wireless sensor networks is energy stringency. Constructing a connected dominating set (CDS) has been widely used as a topology control strategy to...
149
click to vote
ASP
2003
Springer
15 years 8 months ago
2003
Springer
Disjunctive Logic Programming (DLP) is an advanced formalism for Knowledge Representation and Reasoning (KRR). DLP is very expressive in a precise mathematical sense: it allows to ...
138
click to vote
CEAS
2006
Springer
15 years 7 months ago
2006
Springer
We describe a framework for representing email as well as meeting information as a joint graph. In the graph, documents and meeting descriptions are connected via other nontextual...