Sciweavers

3422 search results - page 38 / 685
» Random Subset Optimization
Sort
View
WIOPT
2006
IEEE
15 years 8 months ago
A structural property of solutions to path optimization problems in random access networks
Abstract— The inherent nature of the physical setup and transmission mechanism in wireless ad hoc networks with random channel access, results in correlation between the link met...
Arzad Alam Kherani, Dinesh Kumar 0002, Eitan Altma...
OL
2011
190views Neural Networks» more  OL 2011»
14 years 9 months ago
On optimality of a polynomial algorithm for random linear multidimensional assignment problem
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
Pavlo A. Krokhmal
STOC
1990
ACM
108views Algorithms» more  STOC 1990»
15 years 6 months ago
Optimal Randomized Algorithms for Local Sorting and Set-Maxima
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
Wayne Goddard, Valerie King, Leonard J. Schulman
FOCM
2007
48views more  FOCM 2007»
15 years 1 months ago
Integration and Optimization of Multivariate Polynomials by Restriction onto a Random Subspace
Abstract. We consider the problem of efficient integration of an n-variate polynomial with respect to the Gaussian measure in Rn and related problems of complex integration and opt...
Alexander I. Barvinok
PAMI
2008
146views more  PAMI 2008»
15 years 1 months ago
Optimal Randomized RANSAC
A randomized model verification strategy for RANSAC is presented. The proposed method finds, like RANSAC, a solution that is optimal with user-specified probability. The solution i...
Ondrej Chum, Jiri Matas