The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
Many classification algorithms use the concept of distance or similarity between patterns. Previous work has shown that it is advantageous to optimize general Euclidean distances (...
The stable marriage problem (SM) has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more general...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
Repositories of multimedia objects having multiple types of attributes e.g., image, text are becoming increasingly common. A selection on these attributes will typically produce n...
We describe the design and evaluation of K-net, a social matching system to help people learn 'who knows what' in an organization by matching people with skills with tho...
N. Sadat Shami, Y. Connie Yuan, Dan Cosley, Ling X...