Recently there has been extensive work on maintaining (approximate) maximum matchings in dynamic graphs. We consider a generalisation of this problem known as themaximum b-matching: Every node v has a positive integral capacity bv, and the goal is to maintain an (approximate) maximum-cardinality subset of edges that contains at most bv edges incident on every node v. The maximum matching proble...

A pattern is a nite string of constant and variable symbols. The language generated by a pattern is the set of all strings of constant symbols which can be obtained from the pattern by substituting non-empty strings for variables. We study the learnability of one-variable pattern languages in the limit with respect to the update time needed for computing a new single hypothesis and the expected...

A pattern is a string of constant and variable symbols. The language generated by a pattern is the set of all strings of constant symbols which can be obtained from by substituting non-empty strings for variables. We study the learnability of one-variable pattern languages in the limit with respect to the update time needed for computing a new single guess and the expected total learning time t...

A pattern is a string of constant and variable symbols. The language generated by a pattern is the set of all strings of constant symbols which can be obtained from by substituting non-empty strings for variables. We study the learnability of one-variable pattern languages in the limit with respect to the update time needed for computing a new single guess and the expected total learning time t...

A pattern is a string of constant and variable symbols. The language generated by a pattern π is the set of all strings of constant symbols which can be obtained from π by substituting non-empty strings for variables. We study the learnability of one-variable pattern languages in the limit with respect to the update time needed for computing a new single guess and the expected total learning ti...

Hierarchical terrain models describe a topographic surface at di erent levels of detail, providing a multiresolution representation as well as a data compression mechanism. In this paper, we consider the problem of computing the visibility map, with respect to a xed viewpoint, on a hierarchical triangle-based terrain model. This problem presents two aspects: the extraction of a visibility map a...

There are many alternatives in a Recommender System (RS) that can be represented by numerical attributes. One of the most challenging tasks in developing RS is the design of techniques that can infer user preferences through observation of their actions. A RS usually stores a personal preference profile associated with each user, but the initial profile of a user is usually incomplete and impre...

Most distance metric learning (DML) approaches focus on learning a Mahalanobis metric for measuring distances between examples. However, for particular feature representations, e.g., histogram features like BOW and SPM, Mahalanobis metric could not model the correlations between these features well. In this work, we define a nonMahalanobis distance for histogram features, via Expected Hitting T...

We consider a communication system in which the outputs of a Markov source are encoded and decoded in real-time by a finite memory receiver, and the distortion measure does not tolerate delays. The objective is to choose designs, i.e. real-time encoding, decoding and memory update strategies that minimize a total expected distortion measure. This is a dynamic team problem with non-classical inf...