Sciweavers

2310 search results - page 386 / 462
» Coloring Random Graphs
Sort
View
ESA
2011
Springer
251views Algorithms» more  ESA 2011»
12 years 7 months ago
Improved Approximation Algorithms for Bipartite Correlation Clustering
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke...
JMLR
2012
11 years 10 months ago
Low rank continuous-space graphical models
Constructing tractable dependent probability distributions over structured continuous random vectors is a central problem in statistics and machine learning. It has proven diffic...
Carl Smith, Frank Wood, Liam Paninski
MOBIHOC
2009
ACM
14 years 8 months ago
Aging rules: what does the past tell about the future in mobile ad-hoc networks?
The study in mobile ad-hoc networks (MANET) is facing challenges brought by recent discovery of non-exponential behavior of the inter-contact time distribution of mobile nodes. In...
Han Cai, Do Young Eun
PDCAT
2005
Springer
14 years 1 months ago
Optimal Routing in a Small-World Network
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
Jianyang Zeng, Wen-Jing Hsu
STACS
2005
Springer
14 years 1 months ago
Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
Petros Drineas, Ravi Kannan, Michael W. Mahoney