Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
The added encoding efficiency and visual quality that is offered by the latest HEVC standard is mostly attained at the cost of a significant increase of the computational complexity at both the encoder and decoder. However, such added complexity greatly compromises the implementation of this standard in computational and energy constrained devices, including embedded systems, mobile and battery supplied...
This paper proposes a model and algorithm to compute the time encoded output of a linear filter directly from the time encoded input. The time encoding machine considered in this study is the integrate-and-fire neuron model. The proposed direct encoding approach is much faster than the indirect approach, involving simulating the filter output and subsequent encoding. A numerical simulation study is...
We present efficient methods for parametrizing planar models, to be used for depth value reconstruction inside selected regions in a depth image. The optimal plane for each region is represented using its quantized heights at three pixel locations. The decoder uses the decoded quantized heights to approximately represent the optimal plane. The three pixel locations are selected so that the distortion...
Dynamic Binary Translation (DBT) allows software compiled for one Instruction Set Architecture (ISA) to be executed on a processor supporting a different ISA. Some modern DBT systems decouple their main execution loop from the built-in Just-In-Time (JIT) compiler, i.e. the JIT compiler can operate asynchronously in a different thread without blocking program execution. However, this creates a problem...
The support recovery problem consists of determining a sparse subset of a set of variables that is relevant in generating a set of observations, and arises in a diverse range of settings such as group testing, compressive sensing, and subset selection in regression. In this paper, we provide a unified approach to support recovery problems, considering general probabilistic observation models relating...
In the present paper, a new approach to region motion description and estimation is introduced, which results particularly suitable for segmentation-based coding strategies for very low bit-rate video coding. Region motion is described through a variable number of motion vectors (MV's) applied to specific control points. No information about this control points is required to be transmitted, as their...
We present a systematic analysis of a lexical-tree based parallel search algorithm for multi-core desktop processors. We introduce an analytical model that predicts the speedup from parallelization after accounting for load imbalance among the cores. Various sources of overhead in the parallel search algorithm are described, benchmarked and analyzed. Besides load imbalance, these include the inherently...
The computational complexity of evaluating homologies between a gene sequence and profile Hidden Markov Models (HMMs) is relatively high. Unfortunately, researchers must re-evaluate matches every time they discover an error in a sequence or encounter a mutation of the sequence. Since these occurrences are frequent, it is desirable to have a low complexity procedure for updating the matching result...
The ability to record and replay program execution helps significantly in debugging non-deterministic MPI applications by reproducing message-receive orders. However, the large amount of data that traditional record-and-reply techniques record precludes its practical applicability to massively parallel applications. In this paper, we propose a new compression algorithm, Clock Delta Compression (CDC),...
Advances in Statistical Machine Translation (SMT) for breaking language barrier have been seen in recent years, and there is huge demand on cross-language dialog communication between people. In this paper we propose to leverage SMT for supporting cross-language dialog communication. Several techniques are applied to improve the performance on a dialog domain, including rescoring, system combination,...
This paper investigates the performance of an overloaded multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) system with a repetition code. It has been demonstrated that diversity with block coding prevents the performance degradation induced by signal multiplexing. However, the computational complexity of a joint decoding scheme increases exponentially with the...
Although simulation is an indispensable tool in computer architecture research and development, there is a pressing need for new modeling techniques to improve simulation speeds while maintaining accuracy and robustness. It is no longer practical to use only cycle-accurate processor simulation (the dominant simulation method) for design space and performance studies due to its extremely slow speed...
Optical fiber links have enabled the transmission of very high data rates over both short-range and long-range links. However, the recent growth in the bandwidth demand has created the need to enhance their data rate capacities. While modern modulation techniques and multiple-input multiple-output (MIMO) based mode-division multiplexing (MDM) techniques with multimode fibers (MMFs) have been demonstrated...
In the (ρr, ρw)-adversarial wiretap (AWTP) channel model of [13], a codeword sent over the communication channel is corrupted by an adversary who observes a fraction ρr of the codeword, and adds noise to a fraction ρw of the codeword. The adversary is adaptive and chooses the subsets of observed and corrupted components, arbitrarily. In this paper we give the first efficient construction of a code...
This paper presents a new approach to buffer dimensioning for dynamic dataflow implementations. A novel transformation applied to the execution trace graph of a dataflow program is introduced in order to generate an event driven system. It is shown how model predictive control theory techniques can be applied to such a system to analyse the execution space of a dataflow program and to define and to...
Most high-performance data processing (aka big-data) systems allow users to express their computation using abstractions (like map-reduce) that simplify the extraction of parallelism from applications. Most frameworks, however, do not allow users to specify how communication must take place: that element is deeply embedded into the run-time system (RTS), making changes hard to implement. In this work...
Over the past decade, the research of decoding visual stimuli from brain signal recorded during a person viewing the image is developing fast as a challenging and up to date work in the neural decoding field. Previous studies have demonstrated that it's possible to identify the one of a set of natural images from human brain activity. In neural decoding studies, the computational model played a key...
We present a handwritten text Keyword Spotting (KWS) approach based on the combination of KWS methods using word-graphs (WGs) and character-lattices (CLs). It aims to solve the problem that WG-based models present for out of vocabulary (OOV) keywords: since there is no available information about them in the lexicon or the language model, null scores are assigned. OOV keywords may have a significant...
In this research a novel discriminative reordering model for statistical machine translation is proposed. Source dependency tree is used to define the orientation classes of the reordering model. We use maximum entropy principle to train the model. In addition to the common features used in the discriminative reordering models, two new and effective features are introduced. They are phrase number...
The quantum computing represents a new field, which is still being researched, that may have numerous applications in the computer arithmetic, in the encryption - decryption systems, rapid search algorithms and physical systems' emulations. The hardware device that can make this type of calculations is still expensive nowadays and the number of the manufacturers is reduced. On the other hand, the...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.