4171 search results - page 405 / 835 » Choice numbers of graphs |
198
click to vote
ECIR
2011
Springer
14 years 10 months ago
2011
Springer
Expert finding addresses the problem of retrieving a ranked list of people who are knowledgeable on a given topic. Several models have been proposed to solve this task, but so far...
194
click to vote
CVPR
2005
IEEE
16 years 9 months ago
2005
IEEE
We optimize over the set of corrected laplacians (CL) associated with a weighted graph to improve the average case normalized cut (NCut) of a graph. Unlike edge-relaxation SDPs, o...
178
click to vote
WEBI
2009
Springer
16 years 1 months ago
2009
Springer
—In this paper, we investigate the problem of supporting keyword-based searching for the discovery of software resources that are installed on the nodes of largescale, federated ...
158
click to vote
COCOON
2007
Springer
16 years 1 months ago
2007
Springer
We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a uni...
185
click to vote
SAC
2005
ACM
16 years 15 days ago
2005
ACM
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...