Sciweavers

471 search results - page 20 / 95
» On the Relative Dominance of Paging Algorithms
Sort
View
STACS
2004
Springer
15 years 3 months ago
Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines
Abstract. We consider the problem of scheduling jobs on related machines owned by selfish agents and provide the first deterministic mechanisms with constant approximation that a...
Vincenzo Auletta, Roberto De Prisco, Paolo Penna, ...
WWW
2009
ACM
15 years 10 months ago
Automated construction of web accessibility models from transaction click-streams
Screen readers, the dominant assistive technology used by visually impaired people to access the Web, function by speaking out the content of the screen serially. Using screen rea...
Jalal Mahmud, Yevgen Borodin, I. V. Ramakrishnan, ...
UIST
2010
ACM
14 years 7 months ago
Mixture model based label association techniques for web accessibility
An important aspect of making the Web accessible to blind users is ensuring that all important web page elements such as links, clickable buttons, and form fields have explicitly ...
Muhammad Asiful Islam, Yevgen Borodin, I. V. Ramak...
ISCI
2011
14 years 4 months ago
Sequential covering rule induction algorithm for variable consistency rough set approaches
We present a general rule induction algorithm based on sequential covering, suitable for variable consistency rough set approaches. This algorithm, called VC-DomLEM, can be used f...
Jerzy Blaszczynski, Roman Slowinski, Marcin Szelag
DAM
1999
119views more  DAM 1999»
14 years 9 months ago
On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
David Manlove