309 results on '"Benjamin Moseley"'
Search Results
2. Pre-Synaptic Pool Modification (PSPM): A supervised learning procedure for recurrent spiking neural networks.
3. Simultaneously Approximating All 𝓁p-Norms in Correlation Clustering.
4. On the Convergence Rate of Linear Datalog ^∘ over Stable Semirings.
5. The Public University Secretary Problem.
6. Scheduling Out-Trees Online to Optimize Maximum Flow.
7. Controlling Tail Risk in Online Ski-Rental.
8. Sampling for Beyond-Worst-Case Online Ranking.
9. A competitive algorithm for throughput maximization on identical machines.
10. Best of Many in Both Worlds: Online Resource Allocation with Predictions under Unknown Arrival Model.
11. Asymptotically Optimal Scheduling of Multiple Parallelizable Job Classes.
12. Incremental Topological Ordering and Cycle Detection with Predictions.
13. Configuration Balancing for Stochastic Requests.
14. Online Dynamic Acknowledgement with Learned Predictions.
15. Online State Exploration: Competitive Worst Case and Learning-Augmented Algorithms.
16. Predictive Flows for Faster Ford-Fulkerson.
17. Fast Combinatorial Algorithms for Min Max Correlation Clustering.
18. Minimizing Completion Times for Stochastic Jobs via Batched Free Times.
19. Min-Max Submodular Ranking for Multiple Agents.
20. Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search.
21. Scheduling (Dagstuhl Seminar 23061).
22. Massively Parallel Computation: Algorithms and Applications.
23. Online List Labeling with Predictions.
24. Mathematical challenges in scheduling theory.
25. A Competitive Algorithm for Throughput Maximization on Identical Machines.
26. Automatic HBM Management: Models and Algorithms.
27. Learning-Augmented Algorithms for Online Steiner Tree.
28. On the Convergence Rate of Linear Datalogo over Stable Semirings.
29. Controlling Tail Risk in Online Ski-Rental.
30. Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs.
31. One Partition Approximating All 𝓁p-norm Objectives in Correlation Clustering.
32. Online k-Median with Consistent Clusters.
33. The efficiency-fairness balance of Round Robin scheduling.
34. Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models.
35. Relational Algorithms for k-Means Clustering.
36. Structural Iterative Rounding for Generalized k-Median Problems.
37. A Relational Gradient Descent Algorithm For Support Vector Machine Training.
38. Approximate Aggregate Queries Under Additive Inequalities.
39. A Scalable Approximation Algorithm for Weighted Longest Common Subsequence.
40. Robust Online Correlation Clustering.
41. Faster Matchings via Learned Duals.
42. Instance Optimal Join Size Estimation.
43. Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing.
44. An Efficient Reduction of a Gammoid to a Partition Matroid.
45. Hierarchical Clustering in General Metric Spaces using Approximate Nearest Neighbors.
46. Scaling Average-Linkage via Sparse Cluster Embeddings.
47. An Approximation Algorithm for the Matrix Tree Multiplication Problem.
48. Using Predicted Weights for Ad Delivery.
49. Algorithms with Prediction Portfolios.
50. On the impossibility of decomposing binary matroids.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.