2100 search results - page 129 / 420 » Learning to rank on graphs |
190
click to vote
APPROX
2011
Springer
14 years 6 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
197
click to vote
EDBT
2009
ACM
15 years 11 months ago
2009
ACM
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
165
click to vote
ICPR
2010
IEEE
15 years 11 months ago
2010
IEEE
—In this paper, we propose a Multi-Manifold Discriminant Analysis (MMDA) method for face feature extraction and face recognition, which is based on graph embedded learning and un...
172
click to vote
WWW
2010
ACM
16 years 1 months ago
2010
ACM
In this demo, we present a system called iRIN designed for performing image retrieval in image-rich information networks. We first introduce MoK-SimRank to significantly improve...
172
click to vote
ICMCS
2006
IEEE
16 years 14 days ago
2006
IEEE
In this paper, we present an AUC (i.e., the Area Under the Curve of Receiver Operating Characteristics (ROC)) maximization based learning algorithm to design the classifier for ma...