Sciweavers

1368 search results - page 245 / 274
» UXnet: making connections
Sort
View
WWW
2004
ACM
14 years 9 months ago
Accurate, scalable in-network identification of p2p traffic using application signatures
The ability to accurately identify the network traffic associated with different P2P applications is important to a broad range of network operations including application-specifi...
Subhabrata Sen, Oliver Spatscheck, Dongmei Wang
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
14 years 9 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...
CHI
2009
ACM
14 years 9 months ago
QUICKIES: the future of sticky notes
In this paper, we present `QUICKIES', an attempt to bring one of the most useful inventions of the 20th century into the digital age: the ubiquitous sticky notes. `QUICKIES&#...
Pranav Mistry
PODC
2009
ACM
14 years 9 months ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
14 years 9 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs