Vivek Bagaria
YOU?
Author Swipe
View article: Cardiomegaly secondary to patent ductus arteriosus causing extrinsic compression of left pulmonary vein
Cardiomegaly secondary to patent ductus arteriosus causing extrinsic compression of left pulmonary vein Open
Primary pulmonary vein (PV) stenosis is a challenging condition to manage. Recently, extrinsic compression of the PV is being detected has cause of narrowing and subsequent turbulence. This can be managed without direct intervention on the…
View article: Bandit-Based Monte Carlo Optimization for Nearest Neighbors
Bandit-Based Monte Carlo Optimization for Nearest Neighbors Open
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 adaptiv…
View article: Prism Removes Consensus Bottleneck for Smart Contracts
Prism Removes Consensus Bottleneck for Smart Contracts Open
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 whi…
View article: Prism
Prism Open
The concept of a blockchain was invented by Satoshi Nakamoto to maintain a distributed ledger. In addition to its security, important performance measures of a blockchain protocol are its transaction throughput and confirmation latency. In…
View article: Proof-of-Stake Longest Chain Protocols Revisited.
Proof-of-Stake Longest Chain Protocols Revisited. Open
The Nakamoto longest chain protocol has served Bitcoin well in its decade long existence. It is remarkably simple and uses only basic cryptographic primitives, but its proof-of-work framework is energy wasting. Proof-of-stake (PoS) protoco…
View article: Proof-of-Stake Longest Chain Protocols: Security vs Predictability
Proof-of-Stake Longest Chain Protocols: Security vs Predictability Open
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; howev…
View article: Practical Low Latency Proof of Work Consensus
Practical Low Latency Proof of Work Consensus Open
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 r…
View article: Prism: Scaling Bitcoin by 10, 000x.
Prism: Scaling Bitcoin by 10, 000x. Open
Bitcoin is the first fully decentralized permissionless blockchain protocol and achieves a high level of security: the ledger it maintains has guaranteed liveness and consistency properties as long as the adversary has less compute power t…
View article: Deconstructing the Blockchain to Approach Physical Limits
Deconstructing the Blockchain to Approach Physical Limits Open
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 p…
View article: Adaptive Monte-Carlo Optimization.
Adaptive Monte-Carlo Optimization. Open
The celebrated Monte Carlo method estimates a quantity that is expensive to compute by random sampling. We propose adaptive Monte Carlo optimization: a general framework for discrete optimization of an expensive-to-compute function by adap…
View article: Hidden Hamiltonian Cycle Recovery via Linear Programming
Hidden Hamiltonian Cycle Recovery via Linear Programming Open
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 distrib…
View article: Medoids in almost linear time via multi-armed bandits
Medoids in almost linear time via multi-armed bandits Open
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 …
View article: Contrastive Principal Component Analysis
Contrastive Principal Component Analysis Open
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 gen…