Zobrazeno 1 - 10
of 58
pro vyhledávání: '"Bagaria, Vivek"'
The performance of existing permissionless smart contract platforms such as Ethereum is limited by the consensus layer. Prism is a new proof-of-work consensus protocol that provably achieves throughput and latency up to physical limits while retainin
Externí odkaz:
http://arxiv.org/abs/2004.08776
Autor:
Bagaria, Vivek, Dembo, Amir, Kannan, Sreeram, Oh, Sewoong, Tse, David, Viswanath, Pramod, Wang, Xuechao, Zeitouni, Ofer
The Nakamoto longest chain protocol is remarkably simple and has been proven to provide security against any adversary with less than 50% of the total hashing power. Proof-of-stake (PoS) protocols are an energy efficient alternative; however existing
Externí odkaz:
http://arxiv.org/abs/1910.02218
In multi-path routing schemes for payment-channel networks, Alice transfers funds to Bob by splitting them into partial payments and routing them along multiple paths. Undisclosed channel balances and mismatched transaction fees cause delays and fail
Externí odkaz:
http://arxiv.org/abs/1910.01834
Autor:
Yang, Lei, Wang, Xuechao, Bagaria, Vivek, Wang, Gerui, Alizadeh, Mohammad, Tse, David, Fanti, Giulia, Viswanath, Pramod
Bitcoin is the first fully-decentralized permissionless blockchain protocol to achieve a high level of security, but at the expense of poor throughput and latency. Scaling the performance of Bitcoin has a been a major recent direction of research. On
Externí odkaz:
http://arxiv.org/abs/1909.11261
Publikováno v:
Computer and Communications Security, 2019
Transaction throughput, confirmation latency and confirmation reliability are fundamental performance measures of any blockchain system in addition to its security. In a decentralized setting, these measures are limited by two underlying physical net
Externí odkaz:
http://arxiv.org/abs/1810.08092
The celebrated Monte Carlo method estimates an expensive-to-compute quantity by random sampling. Bandit-based Monte Carlo optimization is a general technique for computing the minimum of many such expensive-to-compute quantities by adaptive random sa
Externí odkaz:
http://arxiv.org/abs/1805.08321
We introduce the problem of hidden Hamiltonian cycle recovery, where there is an unknown Hamiltonian cycle in an $n$-vertex complete graph that needs to be inferred from noisy edge measurements. The measurements are independent and distributed accord
Externí odkaz:
http://arxiv.org/abs/1804.05436
Computing the medoid of a large number of points in high-dimensional space is an increasingly common operation in many data science problems. We present an algorithm Med-dit which uses O(n log n) distance evaluations to compute the medoid with high p
Externí odkaz:
http://arxiv.org/abs/1711.00817
We present a new technique called contrastive principal component analysis (cPCA) that is designed to discover low-dimensional structure that is unique to a dataset, or enriched in one dataset relative to other data. The technique is a generalization
Externí odkaz:
http://arxiv.org/abs/1709.06716
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.