#Computer-Science
454 posts in tag “Computer-Science”.
The Mathematics Of Pairwise Differencing For Time Series: Self Joins And Online Algorithms For Change Detection
2022-03-21A comprehensive technical exploration of the mathematics of pairwise differencing for time series: self joins and online algorithms for change detection, covering key concepts, practical implementations, and real-world applications.
Building A Secure Password Authenticated Key Exchange (Pake) From Oblivious Pseudorandom Functions (Oprf)
2022-03-11A comprehensive technical exploration of building a secure password authenticated key exchange (pake) from oblivious pseudorandom functions (oprf), covering key concepts, practical implementations, and real-world applications.
A Deep Dive Into The Yggdrasil Network: Crypto Based Routing With Dht And Spanning Trees
2022-03-06A comprehensive technical exploration of a deep dive into the yggdrasil network: crypto based routing with dht and spanning trees, covering key concepts, practical implementations, and real-world applications.
The Implementation Of A Distributed Hash Table Using Chord: Leaf Sets, Stabilization, And Finger Table Maintenance
2022-02-21A comprehensive technical exploration of the implementation of a distributed hash table using chord: leaf sets, stabilization, and finger table maintenance, covering key concepts, practical implementations, and real-world applications.
Designing A P2P Network For File Sharing: Bittorrent’S Choking Algorithm, Piece Selection, And Rarest First
2022-02-05A comprehensive technical exploration of designing a p2p network for file sharing: bittorrent’s choking algorithm, piece selection, and rarest first, covering key concepts, practical implementations, and real-world applications.
A Rigorous Proof Of The A* Algorithm Admissibility And Consistency: Manhatten Vs. Euclidean Heuristics
2022-02-03A comprehensive technical exploration of a rigorous proof of the a* algorithm admissibility and consistency: manhatten vs. euclidean heuristics, covering key concepts, practical implementations, and real-world applications.
The Performance Of The Bidibfs Algorithm For Unweighted Shortest Paths In Social Networks
2022-01-30A comprehensive technical exploration of the performance of the bidibfs algorithm for unweighted shortest paths in social networks, covering key concepts, practical implementations, and real-world applications.
Implementing A Minimax Player For Go With Monte Carlo Tree Search (Mcts) And Ucb1 Selection
2022-01-29A comprehensive technical exploration of implementing a minimax player for go with monte carlo tree search (mcts) and ucb1 selection, covering key concepts, practical implementations, and real-world applications.
A Comprehensive Look At The Alpha Beta Pruning Algorithm For Game Trees: Expectiminimax And Heuristic Evaluation
2022-01-26A comprehensive technical exploration of a comprehensive look at the alpha beta pruning algorithm for game trees: expectiminimax and heuristic evaluation, covering key concepts, practical implementations, and real-world applications.
Building A Distributed Matrix Factorization Using Alternating Least Squares (Als) In Apache Spark
2022-01-20A comprehensive technical exploration of building a distributed matrix factorization using alternating least squares (als) in apache spark, covering key concepts, practical implementations, and real-world applications.
The Theory Of Online Convex Optimization With Regret Bounds: Follow The Leader Vs. Gradient Descent
2022-01-20A comprehensive technical exploration of the theory of online convex optimization with regret bounds: follow the leader vs. gradient descent, covering key concepts, practical implementations, and real-world applications.
The Implementation Of A Random Forest Training In Mpi: Feature Subsampling And Oob Error Estimation
2022-01-19A comprehensive technical exploration of the implementation of a random forest training in mpi: feature subsampling and oob error estimation, covering key concepts, practical implementations, and real-world applications.
A Practical Guide To Gradient Boosting: Xgboost’S Weighted Quantile Sketch And Sparsity Aware Split Finding
2022-01-10A comprehensive technical exploration of a practical guide to gradient boosting: xgboost’s weighted quantile sketch and sparsity aware split finding, covering key concepts, practical implementations, and real-world applications.
Designing A Lagrangian Relaxation Algorithm For The Traveling Salesman Problem With 1 Trees
2022-01-02A comprehensive technical exploration of designing a lagrangian relaxation algorithm for the traveling salesman problem with 1 trees, covering key concepts, practical implementations, and real-world applications.
The Complexity Of The Network Simplex Algorithm For Minimum Cost Flow
2021-12-23A comprehensive technical exploration of the complexity of the network simplex algorithm for minimum cost flow, covering key concepts, practical implementations, and real-world applications.
A Deep Dive Into The Hat Trie: Array Compressed Trie With Efficient Cache Locality
2021-12-18A comprehensive technical exploration of a deep dive into the hat trie: array compressed trie with efficient cache locality, covering key concepts, practical implementations, and real-world applications.
Implementing A Van Emde Boas Tree For Predecessor Queries In O(Log Log U) Time
2021-12-13A comprehensive technical exploration of implementing a van emde boas tree for predecessor queries in o(log log u) time, covering key concepts, practical implementations, and real-world applications.
The Algorithm For Building A Fibonacci Heap With Decrease Key And Meld In Logarithmic Time
2021-12-06A comprehensive technical exploration of the algorithm for building a fibonacci heap with decrease key and meld in logarithmic time, covering key concepts, practical implementations, and real-world applications.
Building A Self Balancing Binary Search Tree With Weighted Average Rotation (Wavl) For Better Worst Case Balance
2021-12-01A comprehensive technical exploration of building a self balancing binary search tree with weighted average rotation (wavl) for better worst case balance, covering key concepts, practical implementations, and real-world applications.
The Performance Of Binary Search Trees: Treap, Splay Tree, Red Black Tree, And Avl Tree Under Random And Sequential Access
2021-11-18A comprehensive technical exploration of the performance of binary search trees: treap, splay tree, red black tree, and avl tree under random and sequential access, covering key concepts, practical implementations, and real-world applications.
A Detailed Analysis Of The Quickunion Disjoint Set Union Data Structure With Path Compression And Union By Rank
2021-11-04A comprehensive technical exploration of a detailed analysis of the quickunion disjoint set union data structure with path compression and union by rank, covering key concepts, practical implementations, and real-world applications.
Implementing An Exact Cover Solver Using Dancing Links (Knuth’S Algorithm X)
2021-10-30A comprehensive technical exploration of implementing an exact cover solver using dancing links (knuth’s algorithm x), covering key concepts, practical implementations, and real-world applications.
The Complexity Of The Isomorphism Problem For Graphs: Subgraph Isomorphism Via Color Refinement
2021-10-19A comprehensive technical exploration of the complexity of the isomorphism problem for graphs: subgraph isomorphism via color refinement, covering key concepts, practical implementations, and real-world applications.
A Rigorous Proof Of The No Free Lunch Theorem In Optimization: Convex Vs. Non Convex Landscapes
2021-09-28A comprehensive technical exploration of a rigorous proof of the no free lunch theorem in optimization: convex vs. non convex landscapes, covering key concepts, practical implementations, and real-world applications.