Sciweavers

2778 search results - page 63 / 556
» Limit complexities revisited
Sort
View
VECPAR
2004
Springer
15 years 5 months ago
Data Management in Large-Scale P2P Systems
Peer-to-peer (P2P) computing offers new opportunities for building highly distributed data systems. Unlike client-server computing, P2P can operate without central coordination and...
Patrick Valduriez, Esther Pacitti
CF
2007
ACM
15 years 3 months ago
Speculative supplier identification for reducing power of interconnects in snoopy cache coherence protocols
In this work we reduce interconnect power dissipation in Symmetric Multiprocessors or SMPs. We revisit snoopy cache coherence protocols and reduce unnecessary interconnect activit...
Ehsan Atoofian, Amirali Baniasadi, Kaveh Aasaraai
FMICS
2006
Springer
15 years 3 months ago
"To Store or Not To Store" Reloaded: Reclaiming Memory on Demand
Behrmann et al. posed the question whether "To Store or Not To Store" [1] states during reachability analysis, in order to counter the effects of the well-known state spa...
Moritz Hammer, Michael Weber
BCSHCI
2009
15 years 28 days ago
How do people find information on a familiar website?
Previous research has investigated how people either navigate the web as a whole, or find information on websites of which they have little previous knowledge. However, it is now ...
Roy A. Ruddle
CORR
2008
Springer
62views Education» more  CORR 2008»
14 years 12 months ago
On Unique Decodability
In this paper, we propose a revisitation of the topic of unique decodability and of some fundamental theorems of lossless coding. It is widely believed that, for any discrete sourc...
Marco Dalai, Riccardo Leonardi