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

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

2006
Guillaume Bonfante Jean-Yves Marion Romain Péchoux

We a give an intrinsic characterization of the class of functions which are computable in NC that is by a uniform, logarithmic depth and polynomial size family circuit. Recall that the class of functions in ALogTime, that is in logarithmic time on an Alternating Turing Machine, is NC. Our characterization is in terms of first order functional programming languages. We define measure-tools calle...

2013
Amit Gupta Renu Garg

As the cost of software application failures grows and as these failures increasingly impact business performance, software reliability will become progressively more important. Employing effective software reliability engineering techniques to improve product and process reliability would be the industry’s best interests as well as major challenges. As software complexity and software quality ...

2007
Tony Rimmer

VISUAL COMPLEXITY IN TELEVISION NEWS: A TIME SERIES ANALYSIS OF AUDIENCE EVALUATIONS OF AN ELECTRONICALLY ESTIMA ED FORM COMPLEXITY V BLE Tony Rimmer School of Journalism Indiana University Bloomington, IN 47405 Telephone: (812) 335-1717 Office The object of this study was to develop a content-free, form complexity measure of a network TV newscast based on pixel light Intensity, and to test aud...

2006
Yiu-Pong Lai Man-Hung Siu

Most speech models represent the static and derivative cepstral features with separate models that can be inconsistent with each other. In our previous work, we proposed the hidden spectral peak trajectory model (HSPTM) in which the static cepstral trajectories are derived from a set of hidden trajectories of the spectral peaks (captured as spectral poles) in the time-frequency domain. In this ...

1999
Ashesh Shah

In a survey of oligopoly models, techniques of game theory are adapted to find market equilibria and understand deciding forces for firms. We look at situations with increasing complexity, to develop a better understanding of the usefulness of the game theory in market analysis. Initially, we explore the basics of game theory. Then, following an introduction of basic microeconomics, we explore ...

Journal: :IEEE Computer 1996
Thomas Ball Stephen G. Eick

Software is invisible, disappearing into les on disks. The invisible nature of software contributes to low programmer productivity by hiding system complexity, particularly for large team-oriented projects. Visualization can help software engineers cope with this complexity and thereby increase programmer productivity. We describe four innovative visual representations of software that scale to...

Journal: :journal of research in rehabilitation sciences 0
محمدتقی امیری خراسانی منصوره مقربی منظری mohammadtaghi amiri-khorasani mansooreh mogharabi manzari

introduction: one of the main sections of warm up is stretching which the importance of them is static and dynamic stretching. the purpose of this study was to examine the effects of static and dynamic stretching within a pre-exercise warm-up on the static and dynamic in soccer players. materials and methods: eighteen physical education female students (height: 159.68 ± 5.94 cm; mass: 60.21 ± 5...

2012
Mo Zhu Adegbenga B. Awoseyila Barry G. Evans

A low-complexity time-domain channel estimation technique for OFDM systems is proposed. It uses a training symbol (preamble) to estimate the channel impulse response (CIR) via circular cross-correlation. An efficient CIR search window technique is also proposed to optimise the accuracy of synchronisation and channel estimation. Simulation results in quasi-static channels show that the proposed ...

Journal: :journal of english language teaching and learning 2012
smaeel abdollahzadeh alireza fard kashani

this study examined the effects of task complexity on written narrative production under different task complexity conditions by efl learners at different proficiency levels. task complexity was manipulated along robinson’s (2001b) proposed task complexity dimension of here-and-now (simple) vs. there-and-then (complex) in. accordingly, three specific measures of the written narratives were targ...

Journal: :IACR Cryptology ePrint Archive 2018
Thaddeus Dryja Quanquan C. Liu Sunoo Park

Pebble games were originally formulated to study time-space tradeoffs in computation, modeled by games played on directed acyclic graphs (DAGs). Close connections between pebbling and cryptography have been known for decades. A series of recent research starting with (Alwen and Serbinenko, STOC 2015) has deepened our understanding of the notion of memory-hardness in cryptography— a useful prope...

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

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