436 search results - page 42 / 88 » Recursion and Complexity |
FOCS
2002
IEEE
14 years 23 days ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
Data lineage and data provenance are key to the management of scientific data. Not knowing the exact provenance and processing pipeline used to produce a derived data set often re...
SIGMOD
2004
ACM
14 years 8 months ago
2004
ACM
Existing methods for prediction in spatio-temporal databases assume that objects move according to linear functions. This severely limits their applicability, since in practice mo...
WSOM
2009
Springer
14 years 2 months ago
2009
Springer
We propose Merge Growing Neural Gas (MGNG) as a novel unsupervised growing neural network for time series analysis. MGNG combines the state-of-the-art recursive temporal context of...
MLDM
2007
Springer
14 years 1 months ago
2007
Springer
Recursive Feature Elimination (RFE) combined with feature ranking is an effective technique for eliminating irrelevant features when the feature dimension is large, but it is diffi...