776 search results - page 141 / 156 » Distributed Information Regularization on Graphs |
142
Voted
CC
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. A key scalability challenge for interprocedural dataflow analysis comes from large libraries. Our work addresses this challenge for the general category of interprocedura...
112
Voted
NIPS
2008
15 years 3 months ago
2008
Motivated by applications like elections, web-page ranking, revenue maximization etc., we consider the question of inferring popular rankings using constrained data. More specific...
105
click to vote
UAI
2004
15 years 3 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
108
Voted
TWC
2008
15 years 1 months ago
2008
In this paper, we consider a class of energy-aware routing algorithm that explicitly takes into account the connectivity of the remaining sensor network. In typical sensor network ...
120
Voted
PERCOM
2010
ACM
15 years 8 days ago
2010
ACM
In this paper, we explore how to effectively create and use "instant mesh networks", i.e., wireless mesh networks that are dynamically deployed in temporary circumstances...