3958 search results - page 471 / 792 » Dynamic Graph Algorithms with Applications |
201
click to vote
JMLR
2010
15 years 5 months ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
194
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Relational clustering has attracted more and more attention due to its phenomenal impact in various important applications which involve multi-type interrelated data objects, such...
181
click to vote
SPAA
2006
ACM
16 years 18 days ago
2006
ACM
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
202
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
144
click to vote
PODC
2009
ACM
16 years 1 months ago
2009
ACM
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic distributed tool that an abstraction for managing the consumption of a global resource i...