Sciweavers

14161 search results - page 422 / 2833
» On generalized middle-level problem
Sort
View
WEA
2005
Springer
100views Algorithms» more  WEA 2005»
16 years 8 days ago
Rounding to an Integral Program
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...
Refael Hassin, Danny Segev
CTRSA
2008
Springer
100views Cryptology» more  CTRSA 2008»
15 years 8 months ago
A Latency-Free Election Scheme
We motivate and describe the problem of finding protocols for multiparty computations that only use a single broadcast round per computation (latency-free computations). We show t...
Kristian Gjøsteen
ESANN
2007
15 years 8 months ago
Nearest Neighbor Distributions and Noise Variance Estimation
In this paper, we address the problem of deriving bounds for the moments of nearest neighbor distributions. The bounds are formulated for the general case and specifically applied...
Elia Liitiäinen, Francesco Corona, Amaury Len...
WCE
2007
15 years 8 months ago
A Multidimensional Bisection Method for Minimizing Function over Simplex
—A new method for minimization problem over simplex, as a generalization of a well-known in onedimensional optimization bisection method is proposed. The convergence of the metho...
A. N. Baushev, E. Y. Morozova
MP
2006
134views more  MP 2006»
15 years 6 months ago
Cubic regularization of Newton method and its global performance
In this paper, we provide theoretical analysis for a cubic regularization of Newton method as applied to unconstrained minimization problem. For this scheme, we prove general local...
Yurii Nesterov, Boris T. Polyak