2168 search results - page 338 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
137
Voted
MOBICOM
2009
ACM
15 years 10 months ago
2009
ACM
A growing number of mobile computing applications are centered around the user’s location. The notion of location is broad, ranging from physical coordinates (latitude/longitude...
120
Voted
PODC
2004
ACM
15 years 9 months ago
2004
ACM
We establish a new worst-case upper bound on the Membership problem: We present a simple algorithm that is able to always achieve Agreement on Views within a single message latenc...
153
Voted
BMCBI
2008
15 years 3 months ago
2008
Background: R is the preferred tool for statistical analysis of many bioinformaticians due in part to the increasing number of freely available analytical methods. Such methods ca...
237
Voted
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database...
135
click to vote
SIGECOM
2009
ACM
15 years 10 months ago
2009
ACM
Restricting the preferences of the agents by assuming that their utility functions linearly depend on a payment allows for the positive results of the Vickrey auction and the Vick...