Sciweavers

7150 search results - page 412 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
COCOON
2005
Springer
16 years 11 days ago
Algorithms for Finding Distance-Edge-Colorings of Graphs
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishize...
COMGEO
2006
ACM
15 years 6 months ago
A new algorithmic approach to the computation of Minkowski functionals of polyconvex sets
An algorithm is proposed for the simultaneous computation of all Minkowski functionals (except for the volume) of sets from the convex ring in Rd discretized with respect to a give...
Simone Klenk, Volker Schmidt, Evgueni Spodarev
TSP
2008
69views more  TSP 2008»
15 years 6 months ago
Stochastic Stability Analysis for the Constant-Modulus Algorithm
We derive an easy-to-compute approximate bound for the range of step-sizes for which the constant-modulus algorithm (CMA) will remain stable if initialized close to a minimum of t...
Victor H. Nascimento, M. T. M. Silva
ICML
2008
IEEE
16 years 7 months ago
Training structural SVMs when exact inference is intractable
While discriminative training (e.g., CRF, structural SVM) holds much promise for machine translation, image segmentation, and clustering, the complex inference these applications ...
Thomas Finley, Thorsten Joachims
FOCS
2007
IEEE
16 years 1 months ago
Towards Sharp Inapproximability For Any 2-CSP
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...
Per Austrin