Sciweavers

392 search results - page 66 / 79
» Maximal Completion
Sort
View
JCDL
2005
ACM
100views Education» more  JCDL 2005»
14 years 1 months ago
What's there and what's not?: focused crawling for missing documents in digital libraries
Some large scale topical digital libraries, such as CiteSeer, harvest online academic documents by crawling open-access archives, university and author homepages, and authors’ s...
Ziming Zhuang, Rohit Wagle, C. Lee Giles
SP
2006
IEEE
148views Security Privacy» more  SP 2006»
14 years 1 months ago
SubVirt: Implementing malware with virtual machines
Attackers and defenders of computer systems both strive to gain complete control over the system. To maximize their control, both attackers and defenders have migrated to low-leve...
Samuel T. King, Peter M. Chen, Yi-Min Wang, Chad V...
SIGMETRICS
1998
ACM
13 years 12 months ago
Scheduling Policies to Support Distributed 3D Multimedia Applications
We consider the problem of scheduling tasks with unpredictable service times on distinct processing nodes so as to meet a real-time deadline, given that all communication among no...
Thu D. Nguyen, John Zahorjan
INFOCOM
2012
IEEE
11 years 10 months ago
Realizing the full potential of PSM using proxying
Abstract—The WiFi radio in smartphones consumes a significant portion of energy when active. To reduce the energy consumption, the Power Saving Mode was standardized in IEEE 802...
Ning Ding, Abhinav Pathak, Dimitrios Koutsonikolas...
SAGT
2009
Springer
136views Game Theory» more  SAGT 2009»
14 years 2 months ago
Non-clairvoyant Scheduling Games
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...
Christoph Dürr, Nguyen Kim Thang