Sciweavers

2950 search results - page 58 / 590
» Computing with Infinitely Many Processes
Sort
View
ESA
2006
Springer
92views Algorithms» more  ESA 2006»
14 years 15 days ago
Out-of-Order Event Processing in Kinetic Data Structures
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...
CCE
2011
13 years 13 days ago
Time representations and mathematical models for process scheduling problems
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...
REST
2010
ACM
14 years 1 months ago
A RESTful messaging system for asynchronous distributed processing
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...
Ian Jacobi, Alexey Radul

Book
3743views
15 years 6 months ago
Image processing and data analysis: The multiscale approach
"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...
Jean-Luc Starck, Fionn Murtagh, Albert Bijaoui
ICML
2004
IEEE
14 years 9 months ago
Gaussian process classification for segmenting and annotating sequences
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...
Yasemin Altun, Thomas Hofmann, Alex J. Smola