Sciweavers

2949 search results - page 548 / 590
» Universal Sparse Modeling
Sort
View
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
14 years 9 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah
SIGMOD
2003
ACM
124views Database» more  SIGMOD 2003»
14 years 9 months ago
Dynamic XML documents with distribution and replication
The advent of XML as a universal exchange format, and of Web services as a basis for distributed computing, has fostered the apparition of a new class of documents: dynamic XML do...
Serge Abiteboul, Angela Bonifati, Gregory Cobena, ...
DCC
2006
IEEE
14 years 8 months ago
Compressed Data Structures: Dictionaries and Data-Aware Measures
Abstract. We propose measures for compressed data structures, in which space usage is measured in a data-aware manner. In particular, we consider the fundamental dictionary problem...
Ankur Gupta, Wing-Kai Hon, Rahul Shah, Jeffrey Sco...
SPAA
2009
ACM
14 years 3 months ago
Distributed algorithms for QoS load balancing
We consider a dynamic load balancing scenario in which users allocate resources in a non-cooperative and selfish fashion. The perceived performance of a resource for a user decre...
Heiner Ackermann, Simon Fischer, Martin Hoefer, Ma...
INFOCOM
2009
IEEE
14 years 3 months ago
Defending Mobile Phones from Proximity Malware
—As mobile phones increasingly become the target of propagating malware, their use of direct pair-wise communication mechanisms, such as Bluetooth and WiFi, pose considerable cha...
Gjergji Zyba, Geoffrey M. Voelker, Michael Liljens...