Sciweavers

4781 search results - page 616 / 957
» Complexity at large
Sort
View
IPPS
2009
IEEE
16 years 4 days ago
Competitive buffer management with packet dependencies
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...
IV
2009
IEEE
114views Visualization» more  IV 2009»
16 years 4 days ago
Chronos: A Tool for Interactive Scheduling and Visualisation of Task Hierarchies
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, ...
LICS
2009
IEEE
16 years 4 days ago
An Improved Lower Bound for the Complementation of Rabin Automata
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 ...
Yang Cai, Ting Zhang, Haifeng Luo
ATAL
2009
Springer
16 years 2 days ago
Analyzing the performance of randomized information sharing
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...
CIKM
2009
Springer
16 years 2 days ago
Fragment-based clustering ensembles
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 ...
Ou Wu, Mingliang Zhu, Weiming Hu