16404 search results - page 844 / 3281 » A set coverage problem |
217
click to vote
WWW
2008
ACM
16 years 8 months ago
2008
ACM
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
222
click to vote
STOC
2002
ACM
16 years 8 months ago
2002
ACM
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
176
click to vote
CEC
2007
IEEE
16 years 1 months ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
200
click to vote
ESA
2004
Springer
16 years 1 months ago
2004
Springer
Our work is motivated by the problem of managing data on storage devices, typically a set of disks. Such storage servers are used as web servers or multimedia servers, for handling...
194
click to vote
ICCS
2004
Springer
16 years 1 months ago
2004
Springer
We consider a kernel-based approach to nonlinear classification that coordinates the generation of “synthetic” points (to be used in the kernel) with “chunking” (working wi...