We introduce the problem of managing a FIFO buffer of bounded space, where arriving packets have dependencies among them. Our model is motivated by the scenario where large data f...
Alexander Kesselman, Boaz Patt-Shamir, Gabriel Sca...
Visualisation and structuring of tasks in a schedule, from relatively simple activities such as meeting scheduling to more complex ones such as project planning, has been traditio...
Saturnino Luz, Masood Masoodian, Daniel McKenzie, ...
Automata on infinite words (ω-automata) have wide applications in formal language theory as well as in modeling and verifying reactive systems. Complementation of ωautomata is ...
In large, collaborative, heterogeneous teams, team members often collect information that is useful to other members of the team. Recognizing the utility of such information and d...
Prasanna Velagapudi, Oleg A. Prokopyev, Katia P. S...
Clustering ensembles combine different clustering solutions into a single robust and stable one. Most of existing methods become highly time-consuming when the data size turns to ...