360 search results - page 63 / 72 » Distributed Network Querying with Bounded Approximate Cachin... |
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
As online social networking emerges, there has been increased interest to utilize the underlying social structure as well as the available social information to improve search. In...
100
click to vote
SIGMOD
2011
ACM
14 years 8 days ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
SIGMETRICS
2003
ACM
15 years 2 months ago
2003
ACM
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
CIKM
2010
Springer
14 years 7 months ago
2010
Springer
In this paper, we study a novel problem Collective Active Learning, in which we aim to select a batch set of "informative" instances from a networking data set to query ...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...