Sciweavers

676 search results - page 74 / 136
» On Approximation Lower Bounds for TSP with Bounded Metrics
Sort
View
TSMC
2010
15 years 26 days ago
Distance Approximating Dimension Reduction of Riemannian Manifolds
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
Changyou Chen, Junping Zhang, Rudolf Fleischer
CORR
2010
Springer
182views Education» more  CORR 2010»
15 years 6 months ago
Index coding via linear programming
Abstract Anna Blasiak Robert Kleinberg Eyal Lubetzky Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and e...
Anna Blasiak, Robert D. Kleinberg, Eyal Lubetzky
CVPR
2007
IEEE
16 years 8 months ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
APPROX
2005
Springer
106views Algorithms» more  APPROX 2005»
15 years 11 months ago
Approximating the Bandwidth of Caterpillars
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...
Uriel Feige, Kunal Talwar
SODA
2008
ACM
128views Algorithms» more  SODA 2008»
15 years 7 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, ...