Showing results 1 to 20 of 25
next >
| Title | Author(s) | Issue Date | |
|---|---|---|---|
Analyzing Node-Weighted Oblivious Matching Problem via Continuous LP with Jump Discontinuity Journal:ACM Transactions on Algorithms | 2018 | ||
Beating ratio 0.5 for weighted oblivious matching problems Proceeding/Conference:European Symposium on Algorithms, ESA 2016 Proceedings | 2016 | ||
Distributed PageRank computation with improved round complexities Journal:Information Sciences | 2022 | ||
Dynamic tree shortcut with constant degree Proceeding/Conference:Lecture Notes in Computer Science | 2015 | ||
Efficient algorithm for computing all low s-t edge connectivities in directed graphs Proceeding/Conference:Lecture Notes in Computer Science | 2015 | ||
Finding k most influential edges on flow graphs Journal:Information Systems | 2017 | ||
Fragmented JPEG file recovery using pseudo headers Proceeding/Conference:IFIP Advances in Information and Communication Technology | 2015 | ||
Fully Online Matching Journal:Journal of the ACM | 2020 | ||
Fully Online Matching II: Beating Ranking and Water-filling Proceeding/Conference:The 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS) | 2020 | ||
How to match when all vertices arrive online Proceeding/Conference:Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2018 | ||
Maintaining Densest Subsets Efficiently in Evolving Hypergraphs Proceeding/Conference:Conference on Information and Knowledge Management, CIKM 2017 Proceedings | 2017 | ||
Masked scene contrast: A scalable framework for unsupervised 3d representation learning Proceeding/Conference:The IEEE / CVF Computer Vision and Pattern Recognition Conference (CVPR) (18/06/2023-22/06/2023, Vancouver) | 18-Jun-2023 | ||
MPR — A Partitioning-Replication Framework for Multi-Processing kNN Search on Road Networks Proceeding/Conference:International Conference on Data Engineering. Proceedings | 2019 | ||
On Minimal Steiner Maximum-Connected Subgraph Queries Journal:IEEE Transactions on Knowledge and Data Engineering | 2017 | ||
Online Makespan Minimization: The Power of Restart Proceeding/Conference:Proceedings of the 21st International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX/RANDOM 2018) | 2018 | ||
Online Submodular Maximization Problem with Vector Packing Constraint Proceeding/Conference:The Annual European Symposium on Algorithms | 2017 | ||
Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals Journal:ACM Transactions on Algorithms | 2019 | ||
Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals Proceeding/Conference:Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) | 2018 | ||
Point transformer v2: Grouped vector attention and partition-based pooling Proceeding/Conference:Conference on Neural Information Processing Systems (28/11/2022-09/12/2022, New Orleans Ernest N. Morial Convention Center) | 28-Nov-2022 | ||
Privacy reference monitor - A computer model for law compliant privacy protection Proceeding/Conference:Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS | 2009 |