142 search results - page 2 / 29 » Matrix Trees |
FLAIRS
2003
13 years 6 months ago
2003
In this work two indexing approaches are presented for case-based reasoning. The first is a hybrid technique which uses a combination of a matrix structure and a tree structure to...
DAM
2008
13 years 5 months ago
2008
For a graph G, let fij be the number of spanning rooted forests in which vertex j belongs to a tree rooted at i. In this paper, we show that for a path, the fij's can be expr...
SIGIR
2011
ACM
12 years 8 months ago
2011
ACM
A key challenge in recommender system research is how to effectively profile new users, a problem generally known as cold-start recommendation. Recently the idea of progressivel...
AUTOMATICA
2010
13 years 5 months ago
2010
The spectral properties of the incidence matrix of the communication graph are exploited to provide solutions to two multiagent control problems. In particular, we consider the pr...
ICALP
2004
Springer
13 years 10 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...