7006 search results - page 67 / 1402 » Approximation Algorithms |
160
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
196
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
226
click to vote
ALGORITHMICA
2011
15 years 2 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
182
click to vote
ICANN
2007
Springer
16 years 1 months ago
2007
Springer
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several prob...
222
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...