Sciweavers

867 search results - page 122 / 174
» The Generalized Maximum Coverage Problem
Sort
View
INFOCOM
2003
IEEE
14 years 1 months ago
Can Shortest-path Routing and TCP Maximize Utility
TCP-AQM protocols can be interpreted as distributed primal-dual algorithms over the Internet to maximize aggregate utility over source rates. In this paper we study whether TCP–...
Jiantao Wang, Lun Li, Steven H. Low, John Doyle
SODA
2008
ACM
128views Algorithms» more  SODA 2008»
13 years 9 months ago
Analysis of greedy approximations with nonsubmodular potential functions
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
Ding-Zhu Du, Ronald L. Graham, Panos M. Pardalos, ...
NIPS
2004
13 years 9 months ago
Detecting Significant Multidimensional Spatial Clusters
Assume a uniform, multidimensional grid of bivariate data, where each cell of the grid has a count ci and a baseline bi. Our goal is to find spatial regions (d-dimensional rectang...
Daniel B. Neill, Andrew W. Moore, Francisco Pereir...
PAMI
2008
196views more  PAMI 2008»
13 years 7 months ago
Distance Learning for Similarity Estimation
In this paper, we present a general guideline to find a better distance measure for similarity estimation based on statistical analysis of distribution models and distance function...
Jie Yu, Jaume Amores, Nicu Sebe, Petia Radeva, Qi ...
JMLR
2012
11 years 10 months ago
Algorithms for Learning Kernels Based on Centered Alignment
This paper presents new and effective algorithms for learning kernels. In particular, as shown by our empirical results, these algorithms consistently outperform the so-called uni...
Corinna Cortes, Mehryar Mohri, Afshin Rostamizadeh