{"payload":{"pageCount":3,"repositories":[{"type":"Public","name":"ARES","owner":"stanford-futuredata","isFork":false,"description":"","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":308,"forksCount":31,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-13T21:12:59.480Z"}},{"type":"Public","name":"FrugalGPT","owner":"stanford-futuredata","isFork":false,"description":"FrugalGPT: better quality and lower cost for LLM applications","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":2,"starsCount":136,"forksCount":13,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-11T16:42:46.512Z"}},{"type":"Public","name":"ColBERT","owner":"stanford-futuredata","isFork":false,"description":"ColBERT: state-of-the-art neural search (SIGIR'20, TACL'21, NeurIPS'21, NAACL'22, CIKM'22, ACL'23, EMNLP'23)","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":18,"issueCount":63,"starsCount":2510,"forksCount":332,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-19T20:42:53.021Z"}},{"type":"Public","name":"InQuest","owner":"stanford-futuredata","isFork":false,"description":"Accelerating Aggregation Queries on Unstructured Streams of Data","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":7,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-18T15:46:11.525Z"}},{"type":"Public","name":"stk","owner":"stanford-futuredata","isFork":false,"description":"","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":1,"issueCount":2,"starsCount":63,"forksCount":14,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-11T18:48:25.834Z"}},{"type":"Public","name":"Megatron-LM","owner":"stanford-futuredata","isFork":true,"description":"Ongoing research training transformer models at scale","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":2,"issueCount":0,"starsCount":31,"forksCount":1963,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-01-19T02:38:49.909Z"}},{"type":"Public","name":"tasti","owner":"stanford-futuredata","isFork":false,"description":"Semantic Indexes for Machine Learning-based Queries over Unstructured Data (SIGMOD 2022)","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":13,"forksCount":5,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-01-17T21:27:34.830Z"}},{"type":"Public","name":"gavel","owner":"stanford-futuredata","isFork":false,"description":"Code for \"Heterogenity-Aware Cluster Scheduling Policies for Deep Learning Workloads\", which appeared at OSDI 2020","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":1,"issueCount":8,"starsCount":118,"forksCount":31,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-12-28T00:57:06.426Z"}},{"type":"Public","name":"omg","owner":"stanford-futuredata","isFork":false,"description":"","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":20,"forksCount":3,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-09-20T02:52:09.450Z"}},{"type":"Public","name":"abae","owner":"stanford-futuredata","isFork":false,"description":"Accelerating Approximate Aggregation Queries with Expensive Predicates (VLDB 21)","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":2,"forksCount":1,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-09-20T02:46:48.602Z"}},{"type":"Public","name":"FAST","owner":"stanford-futuredata","isFork":false,"description":"End-to-end earthquake detection pipeline via efficient time series similarity search","topicNames":["time-series","earthquakes","minhash-lsh-algorithm","similarity-search"],"topicsNotShown":0,"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":1,"issueCount":12,"starsCount":144,"forksCount":56,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-07-06T21:23:13.266Z"}},{"type":"Public","name":"Willump","owner":"stanford-futuredata","isFork":false,"description":"Willump Is a Low-Latency Useful Machine learning Platform.","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":1,"issueCount":0,"starsCount":43,"forksCount":8,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-03-24T22:40:38.640Z"}},{"type":"Public","name":"pop-ncflow","owner":"stanford-futuredata","isFork":true,"description":"Code for POP (SOSP 2021) and NCFlow (NSDI 2021)","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":11,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-03-07T16:43:59.458Z"}},{"type":"Public","name":"macrobase","owner":"stanford-futuredata","isFork":false,"description":"MacroBase: A Search Engine for Fast Data","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Java","color":"#b07219"},"pullRequestCount":12,"issueCount":20,"starsCount":658,"forksCount":128,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-12-14T20:32:50.709Z"}},{"type":"Public","name":"cs245-as1","owner":"stanford-futuredata","isFork":false,"description":"Student files for CS245 Programming Assignment 1: In-memory data layout","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Java","color":"#b07219"},"pullRequestCount":2,"issueCount":0,"starsCount":12,"forksCount":50,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-11-16T11:44:05.026Z"}},{"type":"Public","name":"sketchstore","owner":"stanford-futuredata","isFork":false,"description":"Algorithms for compressing and merging large collections of sketches","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":3,"issueCount":0,"starsCount":5,"forksCount":2,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-11-16T00:53:24.034Z"}},{"type":"Public","name":"SparseJointShift","owner":"stanford-futuredata","isFork":false,"description":"Model Performance Estimation and Explanation When Labels and A Few Features Shifts","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":7,"forksCount":1,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-11-07T01:11:40.996Z"}},{"type":"Public","name":"loa","owner":"stanford-futuredata","isFork":false,"description":"Public code for LOA","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":18,"forksCount":2,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-10-05T07:57:39.922Z"}},{"type":"Public","name":"parallel-lb-simulator","owner":"stanford-futuredata","isFork":false,"description":"","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Java","color":"#b07219"},"pullRequestCount":0,"issueCount":0,"starsCount":4,"forksCount":2,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-06-01T20:56:20.839Z"}},{"type":"Public","name":"ezmode","owner":"stanford-futuredata","isFork":false,"description":"An iterative algorithm for selecting rare events in large, unlabeled datasets","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-05-25T17:20:05.822Z"}},{"type":"Public","name":"teavar","owner":"stanford-futuredata","isFork":true,"description":"","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":10,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-05-03T22:18:25.498Z"}},{"type":"Public","name":"smol","owner":"stanford-futuredata","isFork":false,"description":"","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":5,"forksCount":3,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-04-03T17:51:54.865Z"}},{"type":"Public","name":"Uniserve","owner":"stanford-futuredata","isFork":false,"description":"A runtime implementation of data-parallel actors.","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Java","color":"#b07219"},"pullRequestCount":0,"issueCount":2,"starsCount":37,"forksCount":6,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-04-01T18:00:43.054Z"}},{"type":"Public","name":"cs245-as2-public","owner":"stanford-futuredata","isFork":false,"description":"","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Scala","color":"#c22d40"},"pullRequestCount":0,"issueCount":0,"starsCount":8,"forksCount":28,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-01-26T00:42:09.712Z"}},{"type":"Public","name":"Baleen","owner":"stanford-futuredata","isFork":false,"description":"Baleen: Robust Multi-Hop Reasoning at Scale via Condensed Retrieval (NeurIPS'21)","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":40,"forksCount":5,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-12-27T22:36:13.170Z"}},{"type":"Public","name":"POP","owner":"stanford-futuredata","isFork":false,"description":"Code for \"Solving Large-Scale Granular Resource Allocation Problems Efficiently with POP\", which appeared at SOSP 2021","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":24,"forksCount":4,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-12-15T17:29:51.799Z"}},{"type":"Public","name":"supg","owner":"stanford-futuredata","isFork":false,"description":"","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":1,"starsCount":5,"forksCount":4,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-07-29T07:04:39.916Z"}},{"type":"Public","name":"sinkhorn-label-allocation","owner":"stanford-futuredata","isFork":false,"description":"Sinkhorn Label Allocation is a label assignment method for semi-supervised self-training algorithms. The SLA algorithm is described in full in this ICML 2021 paper: <a href=\"https://arxiv.org/abs/2102.08622\" rel=\"nofollow\">https://arxiv.org/abs/2102.08622</a>.","topicNames":["image-classification","optimal-transport","semi-supervised-learning","few-shot-learning"],"topicsNotShown":0,"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":53,"forksCount":3,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-06-15T05:08:35.783Z"}},{"type":"Public","name":"blazeit","owner":"stanford-futuredata","isFork":false,"description":"Its BlazeIt because it's blazing fast","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":6,"starsCount":30,"forksCount":10,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-06-12T06:06:47.050Z"}},{"type":"Public","name":"redisgeo-bench","owner":"stanford-futuredata","isFork":false,"description":"Simple benchmark for Redis geosets for top-k queries.","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Rust","color":"#dea584"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-05-28T08:43:36.350Z"}}],"repositoryCount":69,"userInfo":null,"searchable":true,"definitions":[],"typeFilters":[{"id":"all","text":"All"},{"id":"public","text":"Public"},{"id":"source","text":"Sources"},{"id":"fork","text":"Forks"},{"id":"archived","text":"Archived"},{"id":"mirror","text":"Mirrors"},{"id":"template","text":"Templates"}],"compactMode":false},"title":"Repositories"}