We study the problem of designing kinetic data structures (KDS's for short) when event times cannot be computed exactly and events may be processed in a wrong order. In tradi...
Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg...
During the last 15 years, many mathematical models have been developed in order to solve process operation scheduling problems, using discrete or continuous time representations. ...
Sylvain Mouret, Ignacio E. Grossmann, Pierre Pesti...
Traditionally, distributed computing problems have been solved by partitioning data into chunks able to be handled by commodity hardware. Such partitioning is not possible in case...
"There is a very large literature on the theoretical underpinnings of the
wavelet transform. However, theory must be complemented with a significant
amount of practical work...
Many real-world classification tasks involve the prediction of multiple, inter-dependent class labels. A prototypical case of this sort deals with prediction of a sequence of labe...