نتایج جستجو برای: static complexity

تعداد نتایج: 421692  

1992
Thomas Dean Lloyd Greenwald

In this paper we provide a compact, formal description for an important class of problems involving the deployment of diverse equipment (e.g., planes, ships, trucks) to transport cargo (e.g., personnel and material) throughout large geographical areas for private, government, and military purposes. The problem is particularly interesting for its combination of static and dynamic sources of comp...

2010
Sofie Van Landeghem Sampo Pyysalo Tomoko Ohta Yves Van de Peer

As research on biomedical text mining is shifting focus from simple binary relations to more expressive event representations, extraction performance drops due to the increase in complexity. Recently introduced data sets specifically targeting static relations between named entities and domain terms have been suggested to enable a better representation of the biological processes underlying ann...

2011
Timothy J. Wheeler Peter Seiler Andrew K. Packard Gary J. Balas

This paper considers the problem of certifying the performance of a class of model-based fault detection schemes. The underlying plant is assumed to be a linear time-varying (LTV) system subject to a Markov-switching fault input. The fault detection scheme consists of two parts: an LTV component that produces a scalar residual and a static nonlinear function that infers the presence of a fault ...

2015
Premanand P Ghadekar Nilesh A Parmar Nilkanth B Chopade

Texture is an image having repetition of patterns. There are two types, static and dynamic texture. Static texture is an image having repetitions of patterns in the spatial domain. Dynamic texture is number of frames having repetitions in spatial and temporal domain. This paper introduces a novel method for dynamic texture coding to achieve higher compression ratio of dynamic texture using 2D-m...

1992
Thomas Dean Lloyd Greenwald

In this paper we provide a compact, formal description for an important class of problems involving the deployment of diverse equipment (e.g., planes, ships, trucks) to transport cargo (e.g., personnel and material) throughout large geographical areas for private, government, and military purposes. The problem is particularly interesting for its combination of static and dynamic sources of comp...

Journal: :EURASIP J. Adv. Sig. Proc. 2016
Farzad Ansari Mohammad Reza Taban Saeed Gazor

Cancellation of clutter and multipath is an important problem in passive bistatic radars. Some important recent algorithms such as the ECA, the SCA and the ECA-B project the received signals onto a subspace orthogonal to both clutter and pre-detected target subspaces. In this paper, we generalize the SCA algorithm and propose a novel sequential algorithm for clutter and multipath cancellation i...

2005
Kendra Kratkiewicz Richard Lippmann

A taxonomy that uses twenty-two attributes to characterize Cprogram overflows was used to construct 291 small C-program test cases that can be used to diagnostically determine the basic capabilities of static and dynamic analysis buffer overflow detection tools. Attributes in the taxonomy include the buffer location (e.g. stack, heap, data region, BSS, shared memory); scope difference between b...

2007
Kaveh Aasaraai Amirali Baniasadi

The perceptron predictor is a highly accurate branch predictor. Unfortunately this high accuracy comes with high complexity. The high complexity is the result of the large number of computations required to speculate each branch outcome. In this work we aim at reducing the computational complexity for the perceptron predictor. We show that by eliminating unnecessary data from computations, we c...

Journal: :Science 2013
Jaakko V I Timonen Mika Latikka Ludwik Leibler Robin H A Ras Olli Ikkala

Self-assembly is a process in which interacting bodies are autonomously driven into ordered structures. Static structures such as crystals often form through simple energy minimization, whereas dynamic ones require continuous energy input to grow and sustain. Dynamic systems are ubiquitous in nature and biology but have proven challenging to understand and engineer. Here, we bridge the gap from...

Journal: :Inf. Process. Lett. 2004
Gabriel Valiente

The design of efficient graph algorithms usually precludes the test of edge existence, because an efficient support of that operation already requires time (n2) for the initialization of an adjacency-matrix representation. We describe an alternative representation of static directed graphs taking (n+m) initialization time and using (n2) space, which supports the efficient implementation of all ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید