نتایج جستجو برای: generalized implicit enumeration
تعداد نتایج: 220967 فیلتر نتایج به سال:
Zero-shot learning (ZSL) aims to discriminate images from unseen classes by exploiting relations seen via their attribute-based descriptions. Since attributes are often related specific parts of objects, many recent works focus on discovering discriminative regions. However, these methods usually require additional complex part detection modules or attention mechanisms. In this paper, 1) we sho...
A class of implicit multivalued vector equilibrium problems is studied. By using the generalized Fan-Browder fixed point theorem, some existence results of solutions for the implicit multivalued vector equilibrium problems are obtained under some suitable assumptions. Moreover, a stability result of solutions for the implicit multivalued vector equilibrium problems is derived. These results ext...
We propose a new algorithm for the problem of state reduction in incompletely specified finite state machines. Unlike the most commonly used algorithms for this problem, our approach is not based on the enumeration of compatible sets, and, therefore, its performance is not dependent on its number. Instead, the algorithm uses techniques for finite state machine identification that are well known...
BACKGROUND Cognitive schema theories of anxiety postulate that higher-level cognitive processes such as attention and memory are guided by underlying distorted fear associations. While numerous studies investigated these disorder-specific, biased processes, hardly any research addressed the underlying schemata themselves. In particular, no study has ever addressed implicit fear associations in ...
Fault diagnosis is to predict the potential fault sites in a logic IC. In this paper, we particularly address the problem of diagnosing faults that exhibit the so-called Byzantine General’s phenomenon, in which a fault manifests itself as a non-logical voltage level at the fault site. Previously, explicit enumeration was suggested to deal with such a problem. However, it is often too time-consu...
A wide variety of new results in combinatorial enumeration have been obtained recently. Many of these results were prompted by new problems in computer science, while others answered old questions in combinatorics and other fields. The purpose of this note is to survey a subset of these new results, namely those dealing with tree enumeration. A selection of tree enumeration results is presented...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید