Sciweavers

934 search results - page 33 / 187
» A theoretical analysis of the HIFF problem
Sort
View
STACS
2005
Springer
15 years 3 months ago
Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
Petros Drineas, Ravi Kannan, Michael W. Mahoney
CSC
2008
14 years 11 months ago
The Dirichlet problem for the Laplace equation in a starlike domain
Many applications of Mathematical Physics and Engineering are connected with the Laplacian, however, the most part of BVP relevant to the Laplacian are solved in explicit form onl...
Diego Caratelli, Paolo Emilio Ricci
ANTS
2000
Springer
133views Algorithms» more  ANTS 2000»
15 years 2 months ago
Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
Ming-Deh A. Huang, Ka Lam Kueh, Ki-Seng Tan
NIPS
2007
14 years 11 months ago
Linear programming analysis of loopy belief propagation for weighted matching
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we investiga...
Sujay Sanghavi, Dmitry M. Malioutov, Alan S. Wills...
ANOR
2007
80views more  ANOR 2007»
14 years 9 months ago
The minimum shift design problem
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
Luca Di Gaspero, Johannes Gärtner, Guy Kortsa...