Sciweavers

210 search results - page 20 / 42
» Using Input Buffers for Streaming XSLT Processing
Sort
View
CVIU
2010
163views more  CVIU 2010»
13 years 9 months ago
Automated handwashing assistance for persons with dementia using video and a partially observable Markov decision process
This paper presents a real-time vision-based system to assist a person with dementia wash their hands. The system uses only video inputs, and assistance is given as either verbal ...
Jesse Hoey, Pascal Poupart, Axel von Bertoldi, Tam...
FOCS
2008
IEEE
14 years 3 months ago
The Power of Reordering for Online Minimum Makespan Scheduling
In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machi...
Matthias Englert, Deniz Özmen, Matthias Weste...
APLAS
2008
ACM
13 years 11 months ago
Abstraction of Clocks in Synchronous Data-Flow Systems
ion of Clocks in Synchronous Data-flow Systems Albert Cohen1 , Louis Mandel2 , Florence Plateau2 , and Marc Pouzet23 1 INRIA Saclay - Ile-de-France, Orsay, France 2 LRI, Univ. Pari...
Albert Cohen, Louis Mandel, Florence Plateau, Marc...
CIKM
2006
Springer
14 years 22 days ago
Maximizing the sustained throughput of distributed continuous queries
Monitoring systems today often involve continuous queries over streaming data, in a distributed collaborative system. The distribution of query operators over a network of process...
Ioana Stanoi, George A. Mihaila, Themis Palpanas, ...
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
14 years 1 months ago
Preemptive Online Scheduling with Reordering
We consider online preemptive scheduling of jobs, arriving one by one, on m identical parallel machines. A buffer of a fixed size K > 0, which assists in partial reordering of...
György Dósa, Leah Epstein