6582 search results - page 1209 / 1317 » The focus of attention problem |
200
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
: ? Improving Clustering Stability with Combinatorial MRFs Bekkerman, Ron; Scholz, Martin; Viswanathan, Krishnamurthy HP Laboratories HPL-2009-46 Clustering stability, combinatoria...
183
click to vote
PERCOM
2009
ACM
16 years 7 months ago
2009
ACM
In this paper, a DHT-based routing protocol which integrates at the network layer both traditional direct routing, i.e. MANET routing, and indirect key-based routing, i.e. P2P rout...
158
click to vote
MOBIHOC
2009
ACM
16 years 7 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...
200
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
166
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
This paper addresses several key issues in the ArnetMiner system, which aims at extracting and mining academic social networks. Specifically, the system focuses on: 1) Extracting ...