نتایج جستجو برای: algorithmic application
تعداد نتایج: 794377 فیلتر نتایج به سال:
Lidskii’s perturbation theory ( → 0) is presented in algorithmic form. This clarifies the role of a singular step. When such a step is first encountered, the quantification becomes incomplete beyond the singularity in a way that is described. An application is made to Homotopic Deviation. In this particular case, the missing information can be provided by direct computation.
Many application domains require algorithmic support for collections of large bit vectors that are frequently referenced. In a compiler that performs type inferencing, this problem occurred in representing sets of possible types at each program point. This paper presents an incremental hashing technique that performs well in this domain.
We describe a system, developed as part of the Cameron project, which compiles programs written in a single-assignment subset of C called SA-C into dataflow graphs and then into VHDL. The primary application domain is image processing. The system consists of an optimizing compiler which produces dataflow graphs and a dataflow graph to VHDL translator. The method used for the translation is desc...
The paper presents a data and task parallel low-level image processing environment for distributed memory systems. Image processing operators are parallelized by data decomposition using algorithmic skeletons. Image processing applications are parallelized by task decomposition, based on the image application task graph. In this way, an image processing application can be parallelized both by d...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید