4 The Dwork-Robba theorem and the upper semicontinuity of ξ 7→ R(ξ,Σ) 9 4.1 The global growth estimate . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 4.2 The generalized Dwork-Robba theorem . . . . . . . . . . . . . . . . . . . . . . 10 4.3 Upper semicontinuity of ξ 7→ R(ξ,Σ) . . . . . . . . . . . . . . . . . . . . . . . 13 4.4 Continuity of ξ 7→ R(ξ,Σ) at maximal points (Dwork’s tra...

An alternative term for these diagrams is “Euler-Venn diagrams” but they are often inaccurately called “Venn diagrams”. Venn diagrams often look similar, but must contain all possible intersections of contours. In contrast, Euler diagrams contain any desired combination of intersections between the contours. Visualizations of Venn diagrams are often created by taking advantage of the symmetries...

A shape feature by itself is not sufficient for effective 3D model retrieval. Long-lasting semantics shared by a community as well as a short-lived intention of a user determines the similarity of 3D models. In this paper, we describe a method of shape-based 3D model retrieval that employs off-line, semi-supervised learning of multiple classes in the database to capture long-lasting, shared sem...

In this paper, we focus on the task of distilling relation instances from the Web. Most of the approaches for this task were based on provided seed instances or patterns to initiate the process. Thus, the result of the extraction depends largely on the quality of the instances and patterns. For this matter, we propose an iterative mechanism that estimates the reliability of a pattern by the con...

We analyze the interaction of explicit and implicit contracts in a model with selfish and fair principals. Fair principals are willing to honor implicit agreements, whereas selfish principals are not. Principals are privately informed about their types. We investigate a separating equilibrium in which principals reveal their type through the contract offer to the agent. If this equilibrium is p...

Automated feature discovery is a fundamental problem in machine learning. Although classical feature discovery methods do not guarantee optimal solutions in general, it has been recently noted that certain subspace learning and sparse coding problems can be solved efficiently, provided the number of features is not restricted a priori. We provide an extended characterization of this optimality ...

Theory and applications have shown that there are two important types of convergence for convex functions: pointwise convergence and convergence in a topology induced by the convergence of their epigraphs. We show that these two types of convergence are equivalent on the class of convex functions which are equi-lower semicontinuous. This turns out to be maximal classes of convex functions for w...

In this paper we continue our investigations. begun in the previous paper, of describing the solution sets of constrained extremum problems inf Au). l&l-‘(p) (*) where fand f are twice continuously differentiable functionals on a reflexive Banach space V, and r-‘(p) denotes the level set of the functional f with value p E R. Considering p as a parameter in (*) we obtain results concerning the c...

This work presents a detailed analysis and discussion of a new object tracking method using semi-supervised on-line boosting1. In order to avoid the drifting problem, which presents a challenge to adaptive tracking systems, the new approach incorporates prior knowledge of the tracked object into the tracking process via semi-supervised learning. This method makes it possible to distinguish betw...

The Problem: Many important learning problems involve a compromise between competing sources of information. For example, in semi-supervised classification the available training examples typically include a limited set of labeled data as well as a large dataset of unlabeled examples. A number of other problems share the same abstract structure: in estimating graphical models we often need to d...