1092 search results - page 158 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
171
click to vote
ALT
2007
Springer
16 years 3 months ago
2007
Springer
In this paper, we address the issue of learning nonlinearly separable concepts with a kernel classifier in the situation where the data at hand are altered by a uniform classific...
153
click to vote
CDC
2008
IEEE
16 years 23 days ago
2008
IEEE
Abstract— In this paper we demonstrate how one can reformulate the MPC problem for LPV systems to a series of mpLPs by a closed-loop minimax MPC algorithm based on dynamic progra...
130
click to vote
ARITH
2007
IEEE
16 years 19 days ago
2007
IEEE
One considers the problem of finding hard to round cases of a periodic function for large floating-point inputs, more precisely when the function cannot be efficiently approxim...
153
click to vote
ICDM
2005
IEEE
15 years 12 months ago
2005
IEEE
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available b...
159
click to vote
APWEB
2004
Springer
15 years 11 months ago
2004
Springer
Queries to data warehouses often involve hundreds of complex aggregations over large volumes of data, and so it is infeasible to compute these queries by scanning the data sources ...