Most existing inductive learning algorithms assume the availability of a training set of labeled examples. In many domains, however, labeling the examples is a costly process that requires either intensive computation or manual labor. In such cases, it may be beneecial for the learner to be active by intelligent selection of examples for labeling with the goal of reducing the labeling cost. In ...

For the high quality three-dimensional broadcasting, depth maps are important data. Although commercially available depth cameras capture highaccuracy depth maps in real time, their resolutions are much smaller than those of the corresponding color images due to technical limitations. In this paper, we propose the depth map up-sampling method using a high-resolution color image and a low-resolu...

For probabilistic reasoning, one often needs to sample from a combinatorial space. For example, one may need to sample uniformly from the space of all satisfying assignments. Can state-of-the-art search procedures for SAT be used to sample effectively from the space of all solutions? And, if so, how uniformly do they sample? Our initial results find that on the positive side, one can find all s...

Sampling a network with a given probability distribution has been identified as a useful operation. In this paper we propose distributed algorithms for sampling networks, so that nodes are selected by a special node, called the source, with a given probability distribution. All these algorithms are based on a new class of random walks, that we call Random Centrifugal Walks (RCW). A RCW is a ran...

Rapidly-exploring random trees (RRTs) are data structures and search algorithms designed to be used in continuous path planning problems. They are one of the most successful state-of-the-art techniques in motion planning, as they offer a great degree of flexibility and reliability. However, their use in other fields in which search is a commonly used approach has not been thoroughly analyzed. I...

Data structures for efficient sampling from a set of weighted items are an important building block many applications. However, few parallel solutions known. We close these gaps. give efficient, fast, and practicable distributed algorithms data that support single (alias tables, compressed structures). This also yields simplified more space-efficient sequential algorithm alias table constructio...

The purpose of this study was to investigate competitive advantage as a mediator for the influence managerial ability on performance SMEs in Malang City. population research is owners Malang, amounting 113,000 units engaged food processing, handicraft, and handicraft business units. Sampling using Slovin formula with sampling error rate 5% obtained total sample 100 SMEs. method through random p...