361 search results - page 42 / 73 » Maximum subset intersection |
156
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract—The problem of error-control in random linear network coding is considered. A “noncoherent” or “channel oblivious” model is assumed where neither transmitter nor...
166
click to vote
JAL
2006
15 years 6 months ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
198
click to vote
ALGORITHMICA
1998
15 years 5 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
168
click to vote
CORR
2010
Springer
15 years 28 days ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
167
click to vote
ICML
2004
IEEE
16 years 6 months ago
2004
IEEE
We compute a common feature selection or kernel selection configuration for multiple support vector machines (SVMs) trained on different yet inter-related datasets. The method is ...