14518 search results - page 328 / 2904 » Two Problems for Sophistication |
274
Voted
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
136
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
202
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
171
click to vote
SECON
2007
IEEE
16 years 1 months ago
2007
IEEE
— The coverage and connectivity problem in sensor networks has received significant attention of the research community in the recent years. In this paper, we study this problem...
207
click to vote
FOCS
2006
IEEE
16 years 23 days ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...