401 search results - page 58 / 81 » Sparse Quasi-Random Graphs |
SIGECOM
2009
ACM
14 years 2 months ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
ICCV
2009
IEEE
14 years 12 months ago
2009
IEEE
Graph-based semi-supervised learning has gained considerable
interests in the past several years thanks to its effectiveness
in combining labeled and unlabeled data through
labe...
EDBT
2006
ACM
14 years 7 months ago
2006
ACM
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
SIGIR
2009
ACM
14 years 2 months ago
2009
ACM
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...