3475 search results - page 552 / 695 » Backbones in Optimization and Approximation |
187
click to vote
IM
2007
15 years 6 months ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
176
click to vote
JALC
2007
15 years 6 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
197
click to vote
JSAC
2007
15 years 6 months ago
2007
Abstract— Cooperative diversity facilitates spatio-temporal communications without requiring the deployment of physical antenna arrays. While physical layer studies on cooperativ...
154
click to vote
MOC
2000
15 years 6 months ago
2000
The iteratively regularized Gauss-Newton method is applied to compute the stable solutions to nonlinear ill-posed problems F (x) = y when the data y is given approximately by y wit...
173
click to vote
SIAMCOMP
2002
15 years 6 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...