OctoSketch - Enabling Real-Time, Continuous Network Monitoring over Multiple Cores
Innovative framework for scaling sketching algorithms across multiple cores, enhancing network monitoring accuracy and performance with continuous, change-based aggregation mechanism.
Navigating the Tides of the Evolving IT Industry
Explore the IT industry's evolution with Abdul Bari, from PCs to AI. Gain insights on technological shifts, future trends, and the enduring relevance of IT in our rapidly changing world.
Huffman Coding Greedy Algorithm for Text Compression
Explore Huffman Coding for efficient text compression. Learn theory, implementation, and practical coding demonstration to optimize data storage and transmission.
Randomized Algorithms for Rounding and Rank Compression in the Tensor Train Format
Explore randomized algorithms for efficient tensor-train rounding, enhancing performance in quantum systems and condensed matter physics applications with significant computational speedups.
Streaming - Synchronous, Recursion, and Incremental Computation
Explore synchronous streaming operators for elegant support of recursion and incremental computation in databases. Learn about algebraic equivalences and their analogy to discrete signal processing.
Sorting Networks - Harnessing Instruction-Level Parallelism for Efficient Sorting
Explore sorting networks: a parallel approach to comparison-based sorting that can achieve sub-linear time complexity, offering significant speed-up opportunities over traditional methods.
Radix Sort Algorithm - Theory and Implementation
Comprehensive exploration of radix sort algorithm, including theory, complexity analysis, optimization techniques, and code examples. Ideal for deepening understanding of sorting algorithms.
Karp-Rabin String Matching Algorithm for Substring Search
Explore the Karp-Rabin algorithm for efficient string searching using hashing, a key technique in search engine functionality. Learn its implementation and applications.
Count Sort Algorithm - Theory and Implementation
Comprehensive exploration of count sort algorithm, including theory, complexity analysis, optimization techniques, and code examples. Ideal for enhancing understanding of sorting algorithms.
Fundamental Limits to Quantum Computation
Explores quantum computing's potential and limitations, discussing learnability, error mitigation, and non-unital noise impacts on near-term devices and fault-tolerant systems.
Probing the Limits of Classical Computing with Arbitrarily Connected Quantum Circuits
Explore the computational gap between classical and quantum computers through random circuit sampling in highly connected geometries, focusing on limitations and potential improvements.
Continuous-Time Quantum Walks for MAX-CUT Optimization
Explore quantum walks for MAX-CUT optimization, linking Hamiltonians to thermalization. Discover novel insights into unitary dynamics for combinatorial problems using multi-stage walks and Floquet systems.
Learning Shallow Quantum Circuits and Quantum States in Polynomial Time
Efficient algorithms for learning shallow quantum circuits and states, extending to polylog depth. Key techniques involve reconstructing low-complexity quantum systems from local observables.
Circuit Conspiracies - Verifiable NISQ Quantum Supremacy and AI Interpretability
Exploring quantum circuit properties and their implications for NISQ quantum supremacy, with connections to AI interpretability and neural networks.
A Quantum Speed-Up for Approximating the Top Eigenvector of a Matrix via Improved Tomography
Quantum algorithm for approximating top eigenvectors of matrices, offering polynomial speedup over classical methods. Introduces efficient quantum tomography techniques for state and process reconstruction.
The Virtues of the Quantum Approximate Optimization Algorithm
Exploring QAOA's potential for solving combinatorial optimization problems, its performance guarantees, quantum supremacy, and practical limitations in near-term quantum computing.
Classical Algorithm for Simulating Experimental Gaussian Boson Sampling
Explore a classical algorithm for simulating Gaussian boson sampling, challenging claims of quantum advantage in current experiments with high photon loss rates.
Sensible and Sensitive AI for Worker Wellbeing: Factors Informing Adoption and Resistance
Explores factors influencing adoption of AI systems for worker wellbeing, analyzing sensing methods, inference types, and data sharing preferences to guide worker-centered implementations.
Algorithmic Information Theory and Machine Learning in Dynamical Systems
Explore the intersection of Algorithmic Information Theory and Machine Learning for Dynamical Systems in this symposium talk by Boumediene Hamzi from Caltech.
Group-based Cryptography - Advances and Applications
Explore cutting-edge developments in group-based cryptography at this TCC 2023 session, featuring expert insights and discussions on advanced cryptographic techniques.
Lattices and Codes in Cryptography - TCC 2023 Session
Explore cutting-edge research on lattices and codes in cryptography, featuring presentations from leading experts at the Theory of Cryptography Conference 2023.