Sciweavers

1487 search results - page 102 / 298
» The Computational Complexity of Link Building
Sort
View
ICDCS
2007
IEEE
15 years 10 months ago
Combating Double-Spending Using Cooperative P2P Systems
An electronic cash system allows users to withdraw coins, represented as bit strings, from a bank or broker, and spend those coins anonymously at participating merchants, so that ...
Ivan Osipkov, Eugene Y. Vasserman, Nicholas Hopper...
SLIP
2004
ACM
15 years 9 months ago
Optical solutions for system-level interconnect
Throughput, power consumption, signal integrity, pin count and routing complexity are all increasingly important interconnect issues that the system designer must deal with. Recen...
Ian O'Connor
CORR
2010
Springer
99views Education» more  CORR 2010»
15 years 4 months ago
On Equivalence Between Network Topologies
One major open problem in network coding is to characterize the capacity region of a general multi-source multi-demand network. There are some existing computational tools for boun...
Michelle Effros, Tracey Ho, Shirin Jalali
124
Voted
SAC
2008
ACM
15 years 3 months ago
Collaborative software engineering on large-scale models: requirements and experience in ModelBus
This work presents an approach for realizing Model-Driven software engineering in the distributed and multi-developers context. It particularly focuses on the scalability problems...
Prawee Sriplakich, Xavier Blanc, Marie-Pierre Gerv...
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
16 years 4 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