Sciweavers

2715 search results - page 265 / 543
» Total Generalized Variation
Sort
View
ESANN
2000
15 years 5 months ago
The K.U.Leuven competition data: a challenge for advanced neural network techniques
In this paper we shortly discuss the K.U. Leuven time-series prediction competition, which has been held in the framework of the International Workshop on Advanced Black-Box Techni...
Johan A. K. Suykens, Joos Vandewalle
COR
2010
164views more  COR 2010»
15 years 4 months ago
The distributed permutation flowshop scheduling problem
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
B. Naderi, Rubén Ruiz
CORR
2008
Springer
72views Education» more  CORR 2008»
15 years 4 months ago
Longest paths in Planar DAGs in Unambiguous Logspace
Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...
Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar
CORR
2006
Springer
101views Education» more  CORR 2006»
15 years 4 months ago
MDL Convergence Speed for Bernoulli Sequences
The Minimum Description Length principle for online sequence estimation/prediction in a proper learning setup is studied. If the underlying model class is discrete, then the total...
Jan Poland, Marcus Hutter
ISCI
2006
58views more  ISCI 2006»
15 years 4 months ago
Streaming data reduction using low-memory factored representations
Many special purpose algorithms exist for extracting information from streaming data. Constraints are imposed on the total memory and on the average processing time per data item....
David Littau, Daniel Boley