287 results on '"Giovanni Neglia"'
Search Results
52. How Often Should I Access My Online Social Networks?
53. The Role of Network Topology for Distributed Machine Learning.
54. TTL-based Cloud Caches.
55. A New Upper Bound on Cache Hit Probability for Non-anticipative Caching Policies.
56. Elastic Provisioning of Cloud Caches: A Cost-Aware TTL Approach.
57. Guest Editorial: Introduction to the Special Section on Communication-Efficient Distributed Machine Learning.
58. Biases in the Facebook News Feed: A Case Study on the Italian Elections.
59. Throughput-Optimal Topology Design for Cross-Silo Federated Learning.
60. Personalized Federated Learning through Local Memorization.
61. Content Placement in Networks of Similarity Caches.
62. A New Upper Bound on Cache Hit Probability for Non-anticipative Caching Policies.
63. Efficient passive membership inference attack in federated learning.
64. Modelando, Auditando e Prevendo a Visibilidade de Fontes no Facebook: Um Estudo de Caso nas Eleições Italianas.
65. Transient and slim versus recurrent and fat: Random walks and the trees they grow.
66. Fairness in online social network timelines: Measurements, models and mechanism design.
67. Analyzing Count Min Sketch with Conservative Updates.
68. Optimal cache allocation for femto helpers with joint transmission capabilities.
69. Simulated annealing for edge partitioning.
70. Cache policies for linear utility maximization.
71. Implicit Coordination of Caches in Small Cell Networks Under Unknown Popularity Profiles.
72. Feedforward Neural Networks for Caching: n Enough or Too Much?
73. Cache Policies for Linear Utility Maximization.
74. Large Scale Control of Deferrable Domestic Loads in Smart Grids.
75. Access-Time Aware Cache Algorithms.
76. Performance Evaluation of Train Moving-Block Control.
77. Which metrics for vertex-cut partitioning?
78. Growing Networks Through Random Walks Without Restarts.
79. Dissecting demand response mechanisms: the role of consumption forecasts and personalized offers.
80. Subsampling for Chain-Referral Methods.
81. ns-3 Based Framework for Simulating Communication Based Train Control (CBTC) Systems.
82. Access-Time-Aware Cache Algorithms.
83. Adaptive Optimal Stochastic Control of Delay-Tolerant Networks.
84. Geographically fair in-network caching for mobile data offloading.
85. Scalable and privacy-preserving admission control for smart grids.
86. Dynamic backup workers for parallel machine learning.
87. Similarity Caching: Theory and Algorithms.
88. Geographical Load Balancing across Green Datacenters: A Mean Field Analysis.
89. Complexity Analysis of Optimal Recharge Scheduling for Electric Vehicles.
90. Newton's method for constrained norm minimization and its application to weighted graph problems.
91. On the complexity of optimal electric vehicles recharge scheduling.
92. Graph clustering based on mixing time of random walks.
93. How to network in online social networks.
94. Unidirectional probabilistic direct control for deferrable loads.
95. Pay few, influence most: Online myopic network covering.
96. Unidirectional direct load control through smart plugs.
97. Reducing communication overhead for average consensus.
98. On Optimal Packet Routing in Deterministic DTNs.
99. Modeling energy demand aggregators for residential consumers.
100. Analysis of TTL-based cache networks.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.