306 search results - page 48 / 62 » Fault-Tolerant Computation in the Full Information Model |
112
click to vote
CCS
2010
ACM
14 years 12 months ago
2010
ACM
The ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distributed hash table look...
120
click to vote
CIKM
2010
Springer
14 years 10 months ago
2010
Springer
In image retrieval, most existing approaches that incorporate local features produce high dimensional vectors, which lead to a high computational and data storage cost. Moreover, ...
SPAA
2009
ACM
15 years 6 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...
205
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
Keyword queries enjoy widespread usage as they represent an intuitive way of specifying information needs. Recently, answering keyword queries on graph-structured data has emerged ...
108
click to vote
ISVC
2009
Springer
15 years 6 months ago
2009
Springer
While realistic illumination significantly improves the visual quality and perception of rendered images, it is often very expensive to compute. In this paper, we propose a new al...