140 search results - page 27 / 28 » Random projection algorithms for convex set intersection pro... |
STOC
1998
ACM
14 years 2 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
FLAIRS
2008
14 years 3 days ago
2008
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
KDD
2008
ACM
14 years 10 months ago
2008
ACM
Privacy-preserving data mining (PPDM) is an emergent research area that addresses the incorporation of privacy preserving concerns to data mining techniques. In this paper we prop...
TON
2010
13 years 4 months ago
2010
The Maximum Differential Backlog (MDB) control policy of Tassiulas and Ephremides has been shown to adaptively maximize the stable throughput of multihop wireless networks with ran...
ATAL
2009
Springer
14 years 4 months ago
2009
Springer
In context-aware route planning, a set of agents has to plan routes on a common infrastructure and each agent has to plan a conflict-free route from a source to a destination wit...