1254 search results - page 185 / 251 » Making Hard Problems Harder |
MOBIHOC
2009
ACM
14 years 9 months ago
2009
ACM
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...
MOBIHOC
2009
ACM
14 years 9 months ago
2009
ACM
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
KDD
2008
ACM
14 years 9 months ago
2008
ACM
Kernel methods have been applied successfully in many data mining tasks. Subspace kernel learning was recently proposed to discover an effective low-dimensional subspace of a kern...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
In many data mining applications, online labeling feedback is only available for examples which were predicted to belong to the positive class. Such applications include spam filt...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
We present a document routing and index partitioning scheme for scalable similarity-based search of documents in a large corpus. We consider the case when similarity-based search ...