Sciweavers

2031 search results - page 123 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
TCS
2008
14 years 9 months ago
Approximation algorithms for partially covering with edges
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...
Ojas Parekh
IDEAL
2009
Springer
14 years 7 months ago
Optimizing Data Transformations for Classification Tasks
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 (...
José María Valls, Ricardo Aler
ECAI
2010
Springer
14 years 8 months ago
Local search algorithms on the Stable Marriage Problem: Experimental Studies
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, ...
SIGMOD
1996
ACM
116views Database» more  SIGMOD 1996»
15 years 2 months ago
Optimizing Queries over Multimedia Repositories
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...
Surajit Chaudhuri, Luis Gravano
GROUP
2007
ACM
15 years 1 months ago
That's what friends are for: facilitating 'who knows what' across group boundaries
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...