1067 search results - page 101 / 214 » Probabilistic regular graphs |
105
click to vote
JGAA
2006
15 years 3 months ago
2006
We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize the classical Min Coloring problem by using not only stable sets but also cliques to cover ...
128
click to vote
ML
2008
ACM
15 years 3 months ago
2008
ACM
Abstract. Collaborative filtering is a popular method for personalizing product recommendations. Maximum Margin Matrix Factorization (MMMF) has been proposed as one successful lear...
150
click to vote
JGAA
2007
15 years 3 months ago
2007
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...
121
click to vote
NIPS
2003
15 years 4 months ago
2003
Many real-world domains are relational in nature, consisting of a set of objects related to each other in complex ways. This paper focuses on predicting the existence and the type...
108
click to vote
ICMCS
2008
IEEE
15 years 9 months ago
2008
IEEE
In this paper, we propose a Semantic Graphs for Image Search (SGIS) system, which provides a novel way for image search by utilizing collaborative knowledge in Wikipedia and netwo...