Search results for "A* algorithm"
showing 10 items of 2538 documents
3D high definition video coding on a GPU-based heterogeneous system
2013
H.264/MVC is a standard for supporting the sensation of 3D, based on coding from 2 (stereo) to N views. H.264/MVC adopts many coding options inherited from single view H.264/AVC, and thus its complexity is even higher, mainly because the number of processing views is higher. In this manuscript, we aim at an efficient parallelization of the most computationally intensive video encoding module for stereo sequences. In particular, inter prediction and its collaborative execution on a heterogeneous platform. The proposal is based on an efficient dynamic load balancing algorithm and on breaking encoding dependencies. Experimental results demonstrate the proposed algorithm's ability to reduce the…
SimpleBIM: From full ifcOWL graphs to simplified building graphs
2016
International audience; Recent research in semantic web technologies for the built environment has resulted in several proposals to further improve information exchange among stakeholders from the domain. Most notable is the production of several OWL ontologies that allow to capture building data in RDF graphs. For example, an ifcOWL ontology allows to capture IFC data in an RDF graph. As the building data is now available in a semantic graph with an explicit formal basis, it can be restructured and simplified so that it more easily matches the different requirements associated with practical use case scenarios. In this paper, we investigate several proposals and technological approaches to…
Decision support system for telemedicine based on multiple expertise
2002
This paper discusses results of the research in the area of artificial intelligence applications in telemedicine. The main goal of research is to manage multiple expertise obtained from experts-physicians in different countries to develop decision support medical system of broad earmarking based on telecommunication tools. The multilevel representation of medical data is discussed based on the apparatus of metastatistics. The technique is able to acquire semantically essential information from complex dynamics of quasi-periodical medical signals by applying recursively ordinary statistical tools. The voting-type technique is used to find consensus among medical experts in their description …
Speciation via Differential Host–Plant Use in the Tephritid Fly Tephritis conura
2010
The close association between phytophagous insects and host plants and the possibility for specialization on new plants make phytophagous insects prime candidates for sympatric speciation via host-race evolution. In this chapter, we summarize results addressing host-race evolution in the tephritid fly Tephritis conura (Tephritidae) infesting Cirsium heterophyllum and C. oleraceum (Asteraceae). Host plant distributions in allopatry, sympatry and parapatry, and different infestation patterns enabled us to test geographic speciation scenarios, investigate adaptations, and address the importance of plant population history for diversification of T. conura.
A loop-free two-close Gray-code algorithm for listing k-ary Dyck words
2006
AbstractP. Chase and F. Ruskey each published a Gray code for length n binary strings with m occurrences of 1, coding m-combinations of n objects, which is two-close—that is, in passing from one binary string to its successor a single 1 exchanges positions with a 0 which is either adjacent to the 1 or separated from it by a single 0. If we impose the restriction that any suffix of a string contains at least k−1 times as many 0's as 1's, we obtain k-suffixes: suffixes of k-ary Dyck words. Combinations are retrieved as special case by setting k=1 and k-ary Dyck words are retrieved as a special case by imposing the additional condition that the entire string has exactly k−1 times as many 0's a…
On the Cryptanalysis of Two Cryptographic Algorithms That Utilize Chaotic Neural Networks
2015
This paper deals with the security and efficiency issues of two cipher algorithms which utilize the principles of Chaotic Neural Networks (CNNs). The two algorithms that we consider are (1) the CNN-Hash, which is a one-way hash function based on the Piece-Wise Linear Chaotic Map (PWLCM) and the One-Way Coupled Map Lattice (OCML), and (2) the Delayed CNN-Based Encryption (DCBE), which is an encryption algorithm based on the delayed CNN. Although both of these cipher algorithms have their own salient characteristics, our analysis shows that, unfortunately, the CNN-Hash is not secure because it is neither Second-Preimage resistant nor collision resistant. Indeed, one can find a collision with …
Scavenger – A Framework for Efficient Evaluation of Dynamic and Modular Algorithms
2015
Machine Learning methods and algorithms are often highly modular in the sense that they rely on a large number of subalgorithms that are in principle interchangeable. For example, it is often possible to use various kinds of pre- and post-processing and various base classifiers or regressors as components of the same modular approach. We propose a framework, called Scavenger, that allows evaluating whole families of conceptually similar algorithms efficiently. The algorithms are represented as compositions, couplings and products of atomic subalgorithms. This allows partial results to be cached and shared between different instances of a modular algorithm, so that potentially expensive part…
Parallel Calculation of CCSDT and Mk-MRCCSDT Energies.
2010
A scheme for the parallel calculation of energies at the coupled-cluster singles, doubles, and triples (CCSDT) level of theory, several approximate iterative CCSDT schemes (CCSDT-1a, CCSDT-1b, CCSDT-2, CCSDT-3, and CC3), and for the state-specific multireference coupled-cluster ansatz suggested by Mukherjee with a full treatment of triple excitations (Mk-MRCCSDT) is presented. The proposed scheme is based on the adaptation of a highly efficient serial coupled-cluster code leading to a communication-minimized implementation by parallelizing the time-determining steps. The parallel algorithm is tailored for affordable cluster architectures connected by standard communication networks such as …
High precision quantum query algorithm for computing AND-based boolean functions
2010
Quantum algorithms can be analyzed in a query model to compute Boolean functions. Function input is provided in a black box, and the aim is to compute the function value using as few queries to the black box as possible. The complexity of the algorithm is measured by the number of queries on the worst-case input. In this paper we consider computing AND Boolean function. First, we present a quantum algorithm for AND of two bits. Our algorithm uses one quantum query and correct result is obtained with a probability p=4/5, that improves previous results. The main result is generalization of our approach to design efficient quantum algorithms for computing composite function AND(f1,f2) where fi…
Boosting Textual Compression in Optimal Linear Time
2005
We provide a general boosting technique for Textual Data Compression. Qualitatively, it takes a good compression algorithm and turns it into an algorithm with a better compression performance guarantee. It displays the following remarkable properties: (a) it can turn any memoryless compressor into a compression algorithm that uses the “best possible” contexts; (b) it is very simple and optimal in terms of time; and (c) it admits a decompression algorithm again optimal in time. To the best of our knowledge, this is the first boosting technique displaying these properties.Technically, our boosting technique builds upon three main ingredients: the Burrows--Wheeler Transform, the Suffix Tree d…