3049 search results - page 216 / 610 » On the Convergence of Bound Optimization Algorithms |
156
click to vote
ECML
1998
Springer
15 years 10 months ago
1998
Springer
Feature selection is a problem of choosing a subset of relevant features. Researchers have been searching for optimal feature selection methods. `Branch and Bound' and Focus a...
172
click to vote
COLT
2007
Springer
16 years 21 days ago
2007
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
193
click to vote
CIE
2007
Springer
16 years 21 days ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
198
click to vote
DIALM
2005
ACM
15 years 8 months ago
2005
ACM
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
166
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— The problem of finding an optimal path in an uncertain graph arises in numerous applications, including network routing, path-planning for vehicles, and the control of finite...