Sciweavers

1257 search results - page 186 / 252
» A generalization of Euler's constant
Sort
View
COMPGEOM
2011
ACM
12 years 11 months ago
An output-sensitive algorithm for persistent homology
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
Chao Chen, Michael Kerber
INFOCOM
2011
IEEE
12 years 11 months ago
Approximate distance queries and compact routing in sparse graphs
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
Rachit Agarwal, Philip Brighten Godfrey, Sariel Ha...
SIAMAM
2011
12 years 10 months ago
Kinetics of Swelling Gels
We develop a general theory of the swelling kinetics of polymer gels, with the view that a polymer gel is a two-phase fluid. The model we propose is a free boundary problem and ca...
James P. Keener, Sarthok Sircar, Aaron L. Fogelson
COCOON
2011
Springer
12 years 7 months ago
Finding Paths with Minimum Shared Edges
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
Masoud T. Omran, Jörg-Rüdiger Sack, Hami...
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
11 years 10 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák