2681 search results - page 126 / 537 » Problem F |
103
Voted
SODA
2008
ACM
15 years 2 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
104
click to vote
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
92
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We study the calibration problem in circular ultrasound tomography devices for breast imaging, where the sensor positions deviate from the circumference of a perfect circle. We in...
123
click to vote
GLOBECOM
2007
IEEE
15 years 7 months ago
2007
IEEE
— Recent studies indicate the presence of a significant amount of idle licensed spectrum, in different time periods and geographic locations. Prompted by the latest regulatory ch...
145
Voted
ICML
2000
IEEE
16 years 1 months ago
2000
IEEE
Algorithms for feature selection fall into two broad categories: wrappers that use the learning algorithm itself to evaluate the usefulness of features and filters that evaluate f...