1207 search results - page 178 / 242 » On distributed optimization using generalized gossip |
206
Voted
ICDE
2006
IEEE
16 years 2 months ago
2006
IEEE
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
109
click to vote
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
109
click to vote
PPOPP
2003
ACM
15 years 5 months ago
2003
ACM
We present a new method for dynamically detecting potential data races in multithreaded programs. Our method improves on the state of the art in accuracy, in usability, and in ove...
122
Voted
CCS
2008
ACM
15 years 2 months ago
2008
ACM
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
114
click to vote
SIGCOMM
2010
ACM
15 years 25 days ago
2010
ACM
This paper proposes an architecture for optimized resource allocation in Infrastructure-as-a-Service (IaaS)-based cloud systems. Current IaaS systems are usually unaware of the ho...