{"payload":{"pageCount":1,"repositories":[{"type":"Public","name":"OpenHuFu","owner":"BUAA-BDA","isFork":false,"description":"OpenHuFu is an open-sourced data federation system to support collaborative queries over multi databases with security guarantee.","allTopics":["mpc","spatial-analysis","data-privacy","data-sharing","spatial-data-analysis","secure-computation","differential-privacy","spatial-queries","swarm-intelligence","data-security","privacy-preserving","multiparty-computation","federated-learning","data-federation"],"primaryLanguage":{"name":"Java","color":"#b07219"},"pullRequestCount":1,"issueCount":4,"starsCount":705,"forksCount":293,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-07-04T00:56:07.409Z"}},{"type":"Public","name":"sspexp_clone","owner":"BUAA-BDA","isFork":false,"description":"Clone from <a href=\"http://degroup.cis.umac.mo/sspexp/\" rel=\"nofollow\">http://degroup.cis.umac.mo/sspexp/</a>, the implementation of the VLDB'17 paper An Experimental Study on Hub Labeling based Shortest Path Algorithms. ","allTopics":["spatial","shortest-path","shortest-distance"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":2,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-18T12:43:56.441Z"}},{"type":"Public","name":"PrivacyComputing-PaperList","owner":"BUAA-BDA","isFork":false,"description":"This is a recommended paper list for the course of Privacy Computing.","allTopics":["differential-privacy","multi-party-computation","federated-learning","data-federation","privacy-computing"],"primaryLanguage":null,"pullRequestCount":0,"issueCount":0,"starsCount":10,"forksCount":2,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-03-26T18:11:49.370Z"}},{"type":"Public","name":"Algorithm-Course-Code","owner":"BUAA-BDA","isFork":false,"description":"The repository stores the source code of the course, algorithm design and analysis.","allTopics":["course","algorithm-design","algorithm-design-and-analysis"],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-03-18T15:03:19.877Z"}},{"type":"Public","name":"Hufu-FedJoin-Benchmark","owner":"BUAA-BDA","isFork":false,"description":"An Experimental Study on Federated Equi-Joins","allTopics":["benchmark","join","relational-databases","multiparty-computation","data-federation","equi-join"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":2,"forksCount":1,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-02-19T12:22:36.728Z"}},{"type":"Public","name":"HuFu-Fed-Traj-Match","owner":"BUAA-BDA","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-12-12T05:44:22.640Z"}},{"type":"Public","name":"FL-CorePaperList","owner":"BUAA-BDA","isFork":false,"description":"","allTopics":[],"primaryLanguage":null,"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-07-19T14:21:19.297Z"}},{"type":"Public","name":"OpenHuFu-Plugin","owner":"BUAA-BDA","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"Java","color":"#b07219"},"pullRequestCount":0,"issueCount":0,"starsCount":3,"forksCount":4,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-04-09T03:18:10.251Z"}},{"type":"Public","name":"SpatialCrowdsourcing-GOMA","owner":"BUAA-BDA","isFork":false,"description":"GOMA is a two-sided online task assignment problem in Spatial Crowdsourcing.","allTopics":["spatial","spatial-crowdsourcing","online-matching"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":14,"forksCount":2,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-04-02T13:46:23.017Z"}},{"type":"Public","name":"rfedavg","owner":"BUAA-BDA","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":6,"forksCount":1,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-10-04T11:50:45.104Z"}},{"type":"Public","name":"ridesharing-GreedyDP","owner":"BUAA-BDA","isFork":false,"description":"An efficient insertion framework called GreedyDP for shared mobility services.","allTopics":["spatial","ridesharing","route-planning","dial-a-ride"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":12,"forksCount":6,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-08-29T09:17:17.190Z"}},{"type":"Public","name":"SpatialCrowdsourcing-TOBM","owner":"BUAA-BDA","isFork":false,"description":"Two-sided online bipartite matching in spatial data: experiments and analysis","allTopics":["spatial","spatial-crowdsourcing","online-matching"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":7,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-07-30T09:22:32.974Z"}},{"type":"Public","name":"SpatialCrowdsourcing-LTC","owner":"BUAA-BDA","isFork":false,"description":"Latency-oriented Task Completion via Spatial Crowdsourcing","allTopics":["task-assignment","spatial-crowdsourcing","latency-control"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":5,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-03-26T05:05:47.945Z"}},{"type":"Public","name":"trajectory-paperlist","owner":"BUAA-BDA","isFork":false,"description":"A paperlist of the papers about trajectory","allTopics":[],"primaryLanguage":null,"pullRequestCount":0,"issueCount":0,"starsCount":2,"forksCount":2,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-12-14T06:51:40.801Z"}},{"type":"Public","name":"ridesharing-LMD","owner":"BUAA-BDA","isFork":false,"description":"Last-Mile Delivery Made Practical: An Efficient Route Planning Framework with Theoretical Guarantees","allTopics":["spatial","ridesharing","route-planning","dial-a-ride","last-mile-delivery"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":9,"forksCount":4,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-08-16T04:59:22.563Z"}},{"type":"Public","name":"FedShapley","owner":"BUAA-BDA","isFork":false,"description":"Profit Allocation for Federated Learning","allTopics":["federated-learning","shapley-value"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":21,"forksCount":8,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-04-27T11:00:32.108Z"}},{"type":"Public","name":"ridesharing-paperlist","owner":"BUAA-BDA","isFork":false,"description":"A paper list of the papers on ridesharing","allTopics":["ridesharing","route-planning","dial-a-ride"],"primaryLanguage":null,"pullRequestCount":0,"issueCount":0,"starsCount":15,"forksCount":7,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-04-04T13:30:39.286Z"}},{"type":"Public","name":"SpatialCrowdsourcing-MWATP","owner":"BUAA-BDA","isFork":false,"description":"Multi-Worker-Aware Task Planning in Real-Time Spatial Crowdsourcing","allTopics":["spatial","task-assignment","spatial-crowdsourcing"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":5,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-04-04T13:22:01.432Z"}},{"type":"Public","name":"SpatialCrowdsourcing-OSM","owner":"BUAA-BDA","isFork":false,"description":"Preference-Aware Task Assignment in On-Demand Taxi Dispatching: An Online Stable Matching Approach","allTopics":["spatial","stable-marriage","spatial-crowdsourcing","online-matching"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":13,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-04-04T13:13:51.356Z"}},{"type":"Public","name":"SpatialCrowdsourcing-Survey","owner":"BUAA-BDA","isFork":false,"description":"The paper list of our survey on spatial crowdsourcing","allTopics":["spatial","spatial-crowdsourcing"],"primaryLanguage":null,"pullRequestCount":0,"issueCount":0,"starsCount":3,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-04-04T13:12:20.133Z"}}],"repositoryCount":20,"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":"template","text":"Templates"}],"compactMode":false},"title":"BUAA-BDA repositories"}