9532 search results - page 374 / 1907 » Logic, Graphs, and Algorithms |
172
click to vote
PKDD
2010
Springer
15 years 5 months ago
2010
Springer
Given a contact network that changes over time (say, day vs night connectivity), and the SIS (susceptible/infected/susceptible, flu like) virus propagation model, what can we say ...
194
click to vote
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
Clustering methods usually require to know the best number of clusters, or another parameter, e.g. a threshold, which is not ever easy to provide. This paper proposes a new graph-b...
183
click to vote
PDCAT
2005
Springer
16 years 7 days ago
2005
Springer
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
152
click to vote
TABLEAUX
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. linTAP is a tableau prover for the multiplicative and exponential fragment M?LL of Girards linear logic. It proves the validity of a given formula by constructing an anal...
187
Voted
ECAI
1998
Springer
15 years 10 months ago
1998
Springer
We present probabilistic logic programming under inheritance with overriding. This approach is based on new notions of entailment for reasoning with conditional constraints, which...