Sciweavers

976 search results - page 81 / 196
» Evaluating Adversarial Partitions
Sort
View
INFOCOM
2011
IEEE
13 years 19 days ago
Privacy analysis of user association logs in a large-scale wireless LAN
User association logs collected from a large-scale wireless LAN record where and when a user has used the network. Such information plays an important role in wireless network res...
Keren Tan, Guanhua Yan, Jihwang Yeo, David Kotz
IWSOS
2009
Springer
14 years 3 months ago
Laying Pheromone Trails for Balanced and Dependable Component Mappings
This paper presents an optimization framework for finding efficient deployment mappings of replicated service components (to nodes), while accounting for multiple services simult...
Máté J. Csorba, Hein Meling, Poul E....
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
14 years 9 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....
ICALP
2009
Springer
14 years 9 months ago
Algorithms for Secretary Problems on Graphs and Hypergraphs
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
Martin Pál, Nitish Korula
ISCA
2011
IEEE
269views Hardware» more  ISCA 2011»
13 years 18 days ago
Crafting a usable microkernel, processor, and I/O system with strict and provable information flow security
High assurance systems used in avionics, medical implants, and cryptographic devices often rely on a small trusted base of hardware and software to manage the rest of the system. ...
Mohit Tiwari, Jason Oberg, Xun Li 0001, Jonathan V...