3875 search results - page 348 / 775 » Approximation algorithms for the 0-extension problem |
171
click to vote
SISAP
2008
IEEE
16 years 1 months ago
2008
IEEE
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
187
click to vote
ISSAC
2007
Springer
16 years 1 months ago
2007
Springer
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
182
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
183
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
138
click to vote
SIGECOM
2009
ACM
16 years 1 months ago
2009
ACM
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...