116 results on '"Yuichi Yoshida"'
Search Results
2. Lipschitz Continuous Allocations for Optimization Games.
3. Testing Spreading Behavior in Networks with Arbitrary Topologies.
4. Online Algorithms for Spectral Hypergraph Sparsification.
5. Lipschitz Continuous Algorithms for Graph Problems.
6. Controlling Posterior Collapse by an Inverse Lipschitz Constraint on the Decoder Network.
7. Low Degree Testing over the Reals.
8. Sublinear-Time Algorithms for Max Cut, Max E2Lin(q), and Unique Label Cover on Expanders.
9. Downsampling for Testing and Learning in Product Distributions.
10. Average Sensitivity of the Knapsack Problem.
11. Average Sensitivity of Dynamic Programming.
12. Sparsification of Decomposable Submodular Functions.
13. Average Sensitivity of Decision Tree Learning.
14. A Batch-to-Online Transformation under Random-Order Model.
15. GRADES-NDA'23: 6th Joint Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA).
16. One-Tape Turing Machine and Branching Program Lower Bounds for MCSP.
17. Spectral Hypergraph Sparsifiers of Nearly Linear Size.
18. Towards tight bounds for spectral sparsification of hypergraphs.
19. Local Algorithms for Estimating Effective Resistance.
20. Online Risk-Averse Submodular Maximization.
21. RelWalk - A Latent Variable Model Approach to Knowledge Graph Embedding.
22. Ordered Graph Limits and Their Applications.
23. Sensitivity Analysis of the Maximum Matching Problem.
24. Snapshot Multispectral Image Completion Via Self-Dictionary Transformed Tensor Nuclear Norm Minimization With Total Variation.
25. Average Sensitivity of Graph Algorithms.
26. Hypergraph Clustering Based on PageRank.
27. Average Sensitivity of Spectral Clustering.
28. On Random Subsampling of Gaussian Process Regression: A Graphon-Based Analysis.
29. Distribution-Free Testing of Linear Functions on ℝⁿ.
30. Weakly Submodular Function Maximization Using Local Submodularity Ratio.
31. Fast and Private Submodular and k-Submodular Functions Maximization with Matroid Constraints.
32. Average Sensitivity of Euclidean k-Clustering.
33. Testability of Homomorphism Inadmissibility: Property Testing Meets Database Theory.
34. Estimating Walk-Based Similarities Using Random Walk.
35. Sensitivity Analysis of Centralities on Unweighted Networks.
36. Variational Inference of Penalized Regression with Submodular Functions.
37. Cheeger Inequalities for Submodular Transformations.
38. Spectral Sparsification of Hypergraphs.
39. Tight First- and Second-Order Regret Bounds for Adversarial Linear Bandits.
40. A New Approximation Guarantee for Monotone Submodular Function Maximization via Discrete Convexity.
41. 0/1/All CSPs, Half-Integral A-Path Packing, and Linear-Time FPT Algorithms.
42. Guaranteed Sufficient Decrease for Stochastic Variance Reduced Gradient Optimization.
43. Statistically Efficient Estimation for Non-Smooth Probability Densities.
44. Computational Aspects of the Preference Cores of Supermodular Two-Scenario Cooperative Games.
45. Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices.
46. Constant Velocity 3D Convolution.
47. Using k-Way Co-Occurrences for Learning Word Embeddings.
48. Fitting Low-Rank Tensors in Constant Time.
49. Portfolio Optimization for Influence Spread.
50. Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.