2005 search results - page 165 / 401 » Tracking with general regression |
151
click to vote
SODA
2008
ACM
15 years 6 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-...
130
click to vote
ECIS
2003
15 years 6 months ago
2003
Most published research in information systems is underpinned by a positivist or empiricist philosophy. This generally involves the collection of quantitative data and its subsequ...
115
click to vote
IJCAI
1993
15 years 6 months ago
1993
Heuristics used by search algorithms are usually composed of more primitive functions which we call "features". A method for combining features is presented which is bas...
148
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
In some real world situations, linear models are not sufficient to represent accurately complex relations between input variables and output variables of a studied system. Multila...
132
click to vote
JMLR
2008
15 years 5 months ago
2008
The statistical perspective on boosting algorithms focuses on optimization, drawing parallels with maximum likelihood estimation for logistic regression. In this paper we present ...