19 search results - page 4 / 4 » aaim 2008 |
AAIM
2008
Springer
13 years 11 months ago
2008
Springer
For digraphs D and H, a mapping f : V (D)→V (H) is a homomorphism of D to H if uv ∈ A(D) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (D) is associated with co...
AAIM
2008
Springer
13 years 6 months ago
2008
Springer
Many recommendation systems suggest items to users by utilizing the techniques of collaborative filtering (CF) based on historical records of items that the users have viewed, purc...
AAIM
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. Given a digraph D, the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding in D an out-branching with the minimum possible number of leaves, i.e., vert...
ISM
2008
IEEE
13 years 4 months ago
2008
IEEE
It is important for managers and Information Technology professionals to understand data-driven decision support systems and how such systems can provide business intelligence and ...