12519 search results - page 2270 / 2504 » Approximation Problems Categories |
160
click to vote
MOBISYS
2009
ACM
16 years 6 months ago
2009
ACM
Loaded with personal data, e.g. photos, contacts, and call history, mobile phones are truly personal devices. Yet it is often necessary or desirable to share our phones with other...
179
click to vote
MOBISYS
2009
ACM
16 years 6 months ago
2009
ACM
Establishing trust between a group of individuals remains a difficult problem. Prior works assume trusted infrastructure, require an individual to trust unknown entities, or provi...
155
click to vote
MOBIHOC
2009
ACM
16 years 6 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...
153
click to vote
MOBIHOC
2009
ACM
16 years 6 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...
156
click to vote
KDD
2008
ACM
16 years 6 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...