Abstract. In this paper, we consider two new online optimization problems (each with several variants), present similar online algorithms for both, and show that one reduces to the...
A sender wishes to broadcast a message of length n over an alphabet of size k to r users, where each user i, 1 i r should be able to receive one of possible mi messages. The cha...
A novel online dynamic value system for machine learning is proposed in this paper. The proposed system has a dual network structure: data processing network (DPN) and information ...
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
We study several complexity parameters for first order formulas and their suitability for first order learning models. We show that the standard notion of size is not captured by...