2949 search results - page 548 / 590 » Universal Sparse Modeling |
101
Voted
STOC
2002
ACM
16 years 25 days ago
2002
ACM
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 ...
100
click to vote
SIGMOD
2003
ACM
16 years 21 days ago
2003
ACM
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...
71
Voted
DCC
2006
IEEE
16 years 4 days ago
2006
IEEE
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...
SPAA
2009
ACM
15 years 7 months ago
2009
ACM
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...
122
click to vote
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
—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...