7913 search results - page 451 / 1583 » Information Collection on a Graph |
118
click to vote
CIKM
2010
Springer
15 years 3 months ago
2010
Springer
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the movie ‘Godfather...
148
click to vote
EJC
2008
15 years 3 months ago
2008
For a graph G and a set D V (G), define Nr[x] = {xi V (G) : d(x, xi) r} (where d(x, y) is graph theoretic distance) and Dr(x) = Nr[x] D. D is known as an r-identifying code if...
168
click to vote
ICEIS
2010
IEEE
15 years 2 months ago
2010
IEEE
This paper presents a graph-based knowledge representation and reasoning language. This language benefits from an important syntactic operation, which is called a graph homomorphi...
138
click to vote
OTM
2010
Springer
15 years 2 months ago
2010
Springer
The GRASIM (Graph-Aided Similarity calculation) algorithm is designed to solve the problem of ontology-based data matching. We subdivide the matching problem into the ones of restr...
143
Voted
CIKM
2005
Springer
15 years 10 months ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...