309 results on '"Claudio Gentile"'
Search Results
52. An integral LP relaxation for a drayage problem.
53. Strengthening the sequential convex MINLP technique by perspective reformulations.
54. Delay and Cooperation in Nonstochastic Bandits.
55. An algorithm for the microaggregation problem using column generation.
56. Algorithmic Chaining and the Role of Partial Feedback in Online Nonparametric Learning.
57. Boltzmann Exploration Done Right.
58. The application of the Symbolic Aggregate Approximation algorithm (SAX) to radio frequency fingerprinting of IoT devices.
59. Imaging time series for internet of things radio frequency fingerprinting.
60. On the Troll-Trust Model for Edge Sign Prediction in Social Networks.
61. On Context-Dependent Clustering of Bandits.
62. Online Model Selection: a Rested Bandit Formulation.
63. Regret Bound Balancing and Elimination for Model Selection in Bandits and RL.
64. Delay and Cooperation in Nonstochastic Bandits.
65. Collaborative Filtering Bandits.
66. A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints.
67. Improving the Approximated Projected Perspective Reformulation by dual information.
68. Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback.
69. Special Issue on ALT 2015: Guest Editors' Introduction.
70. Flattening a Hierarchical Clustering through Active Learning.
71. The stable set polytope of icosahedral graphs.
72. Approximated perspective relaxations: a project and lift approach.
73. Online Clustering of Bandits.
74. Online Similarity Prediction of Networked Data from Known and Unknown Graphs.
75. Regret Minimization for Branching Experts.
76. A Gang of Bandits.
77. From Bandits to Experts: A Tale of Domination and Independence.
78. Regret Minimization for Reserve Prices in Second-Price Auctions.
79. A Linear Time Active Learning Algorithm for Link Classification.
80. On Multilabel Classification and Ranking with Partial Feedback.
81. See the Tree Through the Lines: The Shazoo Algorithm.
82. Multiclass Classification with Bandit Feedback using Adaptive Regularization.
83. The stable set polytope of claw-free graphs with stability number greater than three.
84. Online Reciprocal Recommendation with Theoretical Performance Guarantees.
85. Robust Selective Sampling from Single and Multiple Teachers.
86. Active Learning on Trees and Graphs.
87. Random Spanning Trees and the Prediction of Weighted Graphs.
88. Regret Minimization for Reserve Prices in Second-Price Auctions.
89. Tight MIP formulations of the power-based unit commitment problem.
90. The k-Gear Composition and the Stable Set Polytope.
91. Learning Unknown Graphs.
92. Robust bounds for classification via selective sampling.
93. Linear Algorithms for Online Multitask Classification.
94. Linear Classification and Selective Sampling Under Low Noise Conditions.
95. On the Stable Set Polytope of Claw-Free Graphs.
96. E sono stato gentile
97. On higher-order perceptron algorithms.
98. Tracking the Best Hyperplane with a Simple Budget Perceptron.
99. Hierarchical classification: combining Bayes with SVM.
100. An algorithm for the microaggregation problem using column generation
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.