Sciweavers

1026 search results - page 195 / 206
» On Finding Minimal w-cutset
Sort
View
NSDI
2010
13 years 9 months ago
ElasticTree: Saving Energy in Data Center Networks
Networks are a shared resource connecting critical IT infrastructure, and the general practice is to always leave them on. Yet, meaningful energy savings can result from improving...
Brandon Heller, Srinivasan Seetharaman, Priya Maha...
NSDI
2010
13 years 9 months ago
Volley: Automated Data Placement for Geo-Distributed Cloud Services
: As cloud services grow to span more and more globally distributed datacenters, there is an increasingly urgent need for automated mechanisms to place application data across thes...
Sharad Agarwal, John Dunagan, Navendu Jain, Stefan...
SIROCCO
2010
13 years 9 months ago
Traffic Grooming in Star Networks via Matching Techniques
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
Ignasi Sau, Mordechai Shalom, Shmuel Zaks
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
13 years 9 months ago
Simultaneous Unsupervised Learning of Disparate Clusterings
Most clustering algorithms produce a single clustering for a given data set even when the data can be clustered naturally in multiple ways. In this paper, we address the difficult...
Prateek Jain, Raghu Meka, Inderjit S. Dhillon
AAAI
2006
13 years 9 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer