7913 search results - page 363 / 1583 » Information Collection on a Graph |
122
click to vote
EWCBR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Effective encoding of information is one of the keys to qualitative problem solving. Our aim is to explore Knowledge representation techniques that capture meaningful wor...
171
click to vote
DATAMINE
2010
15 years 4 months ago
2010
We address the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models...
154
click to vote
JMLR
2010
14 years 11 months ago
2010
This paper studies the feasibility and interpretation of learning the causal structure from observational data with the principles behind the Kolmogorov Minimal Sufficient Statist...
140
click to vote
SIGMOD
2010
ACM
15 years 9 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
131
click to vote
WWW
2005
ACM
16 years 5 months ago
2005
ACM
Being able to determine the provenience of statements is a fundamental step in any SW trust modeling. We propose a methodology that allows signing of small groups of RDF statement...