نتایج جستجو برای: efficient
تعداد نتایج: 434318 فیلتر نتایج به سال:
The folk theorem characterizes the (subgame perfect) Nash equilibrium payo¤s of an undiscounted or discounted in nitely repeated game with fully informed, patient players as the feasible individually rational payo¤s of the one-shot game. To which extent does the result still hold when every player privately knows his own payo¤s ? Under appropriate assumptions (private values and uniform punishm...
Abstract. Applications for video data recorded with a setup of several cameras are currently attracting increasing interest. For such multi-view sequences, efficient coding is crucial to handle the enormous amount of data. However, significant luminance and chrominance variations between the different views, which often originate from imperfect camera calibration, are able to reduce the coding ...
LEDA [MN95, MNU97, MN98] is a collection of implementations of data structures and combinatorial algorithms. In the almost ten years of the project we translated hundreds of algorithms into programs. For the purpose of this paper an algorithm is the description of a problem solving method intended for a human reader and a pwgram is a description intended for machine execution. Clearly, algorith...
We considered kinematic and virial parameters of a sample of galaxy triplets from the Local Supercluster (LS). The galaxies were selected from the LEDA database, and their radial velocities are no more than 3100 km/s. The sample contains 176 systems selected according to the Karachentsev criterion. We calculated the following median parameters of the LS triplets: rms velocity of galaxies with r...
XML message filtering and matching are important operations for the application layer XML message multicast. As a publish/subscribe system and a specific case of content-based multicast in the application layer, XML message multicast depends highly on the data filtering and matching processes. As the XML applications emerge, efficient XML message filtering and matching become more desirable. Ma...
Fair cake-cutting is the division of a cake or resource among N users so that each user is content. Users may value a given piece of cake differently, and information about how a user values different parts of the cake can only be obtained by requesting users to “cut” pieces of the cake into specified ratios. One of the most interesting open questions is to determine the minimum number of cuts ...
The object-oriented design community has recently begun to collect so-called design patterns: cliches plus hints to their recommended use in software construction. The structural design patterns Adapter, Bridge, Composite, Decorator, and Proxy represent packaged problem/context/solution/properties descriptions to common problems in object-oriented design. Localizing instances of these patterns ...
This work presents the concept and realisation of the integration of deliberative and reactive strategies for controlling mobile robot systems. General motion control at the task-level in a partially known environment is divided into two consecutive steps: subgoal planning and subgoal-guided plan execution. A modular fuzzy control scheme is proposed, which allows independent development and exi...
A content-based video indexing method is presented in this paper that aims at temporally indexing a video sequence according to the actual speaker. This is achieved by the integration of audio and visual information. Audio analysis leads to the extraction of a speaker identity label versus time diagram. Visual analysis includes scene cut detection, face shot determination, mouth region extracti...
A class of Nash implementation problems of particular economic interest is that of implementing the core in games of pure allocation, or ‘cake division’. Mechanisms that have been proposed to solve this type of problem often involve off-equilibrium ‘punishments’ that lie in the interior of the feasible set; that is, in which not all the cake is allocated. They also tend to make use of extraneou...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید