Sciweavers

447 search results - page 52 / 90
» Approximation Algorithms for Directed Steiner Problems
Sort
View
COMPGEOM
2009
ACM
15 years 8 months ago
Proximity of persistence modules and their diagrams
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
Frédéric Chazal, David Cohen-Steiner...
CORR
2008
Springer
114views Education» more  CORR 2008»
15 years 1 months ago
Algorithmic Pricing via Virtual Valuations
Algorithmic pricing is the computational problem that sellers (e.g., in supermarkets) face when trying to set prices for their items to maximize their profit in the presence of a ...
Shuchi Chawla, Jason D. Hartline, Robert Kleinberg
IJCV
2011
180views more  IJCV 2011»
14 years 8 months ago
Global Minimization for Continuous Multiphase Partitioning Problems Using a Dual Approach
This paper is devoted to the optimization problem of continuous multipartitioning, or multi-labeling, which is based on a convex relaxation of the continuous Potts model. In contr...
Egil Bae, Jing Yuan, Xue-Cheng Tai
FOCS
2006
IEEE
15 years 7 months ago
Algorithms on negatively curved spaces
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
Robert Krauthgamer, James R. Lee
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
15 years 7 months ago
Using pair approximations to predict takeover dynamics in spatially structured populations
The topological properties of a network directly impact the flow of information through a system. For example, in natural populations, the network of inter-individual contacts aff...
Joshua L. Payne, Margaret J. Eppstein