Snippet Search

Searching 11,374,055 documents.
Discover how a particular term or phrase is used in scientific literature

Showing 1 to 25 of 1239 matching articles

Results per page:

... We analyse the average case  complexity 
The average case complexity of the parallel prefix problem
The average case complexity of the parallel prefix problem
Jakoby, Andreas; Schindelhauer, Christian; Reischuk, Rüdiger; Weis, Stephan
of evaluating all prefixes of an input ...
... The  complexity 
The complexity of the free space for motion planning amidst fat obstacles
The complexity of the free space for motion planning amidst fat obstacles
Stappen, A. Frank
of motion planning algorithms highly ...
... programming system. Now we will develop a  complexity 
Abstract Complexity Theory
Abstract Complexity Theory
Smith, Carl H.
theory that is independent of the machine ...
... The theory of parameterized computational  complexity 
The parameterized complexity of some problems in logic and linguistics
The parameterized complexity of some problems in logic and linguistics
Downey, Rodney G.; Fellows, Michael R.; Kapron, Bruce M.; Hallett, Michael T.; Wareham, H. Todd
introduced in [DF1-3] appears to be of ...
... broadcast and gossip is investigated. The  complexity 
Optimal algorithms for broadcast and gossip in the edge-disjoint path modes
Optimal algorithms for broadcast and gossip in the edge-disjoint path modes
Hromkovič, Juraj; Klasing, Ralf; Unger, Walter; Wagener, Hubert
of communication algorithms is measured by ...
... In this paper we define and study super  complexity 
Definition and existence of super complexity cores
Definition and existence of super complexity cores
Biehl, Ingrid
cores of languages L with respect to ...
... that examines the effects of trial  complexity 
Trial complexity
Trial complexity
Heuer, Larry; Penrod, Steven
and trial procedures on jury performance. ...
... having degree ≤ 2k/4. The computational  complexity 
Using Zech’s Logarithm to Find Low-Weight Parity Checks for Linear Recurring Sequences
Using Zech’s Logarithm to Find Low-Weight Parity Checks for Linear Recurring Sequences
Kühn, G. J.; Penzhorn, W. T.
is O(2k/2), and a table size of 0(2k/2) is ...
... language, whose expressive power and data  complexity 
Expressive power and complexity of disjunctive datalog under the stable model semantics
Expressive power and complexity of disjunctive datalog under the stable model semantics
Eiter, Thomas; Gottlob, Georg; Mannila, Heikki
under the stable model semantics has been ...
... Shannon information and algorithmic  complexity 
Analysis of solar spike events by means of symbolic dynamics methods
Analysis of solar spike events by means of symbolic dynamics methods
Schwarz, U.; Kurths, J.; Witt, A.; Benz, A. O.
are appropriate to characterize such ...
... Shannon information and algorithmic  complexity 
Analysis of Solar Spike Events By Means of Symbolic Dynamics Methods
Analysis of Solar Spike Events By Means of Symbolic Dynamics Methods
Schwarz, U.; Kurths, J.; Witt, A.; Benz, A. O.
are appropriate to characterize such ...
... and the second term represents the model  complexity 
A new criterion for selecting models from partially observed data
A new criterion for selecting models from partially observed data
Shimodaira, Hidetoshi
. ...
... This paper includes some results on  complexity 
Enumerable classes of total recursive functions: Complexity of inductive inference
Enumerable classes of total recursive functions: Complexity of inductive inference
Ambainis, Andris; Smotrovs, Juris
of inductive inference for enumerable ...
... based on, provide powerful bases to tackle  complexity 
Computer-Aided Systems Technology for CAD environments: Complexity issues and a repository-based approach
Computer-Aided Systems Technology for CAD environments: Complexity issues and a repository-based approach
Ören, Tuncer I.; King, Douglas G.
issues as well as modelling and model ...
... quantifiers, which capture regular  complexity 
Oracles and quantifiers
Oracles and quantifiers
Makowsky, J. A.; Pnueli, Y. B.
classes on ordered structures with ...
... the outcome. We give tight bounds on the  complexity 
The power of self-directed learning
The power of self-directed learning
Goldman, Sally A.; Sloan, Robert H.
of self-directed learning for the concept ...
... the outcome. We give tight bounds on the  complexity 
The Power of Self-Directed Learning
The Power of Self-Directed Learning
Goldman, Sally A.; Sloan, Robert H.
of self-directed learning for the concept ...
... The best known algorithm has a time  complexity 
Efficient algorithms for assigning chain-like tasks on a chain-like network computer
Efficient algorithms for assigning chain-like tasks on a chain-like network computer
Young, Gilbert H.; Chan, Chi-Lok
of O((m′-n)2n) if m′−n=O(√log n); ...
... A new method for characterizing the  complexity 
The angle measure technique: A new method for characterizing the complexity of geomorphic lines
The angle measure technique: A new method for characterizing the complexity of geomorphic lines
Andrle, Robert
of geomorphic phenomena is presented. ...
... η 2 uses half the communication  complexity 
Low complexity network synchronization
Low complexity network synchronization
Shabtay, Lior; Segall, Adrian
of synchronizer γ, while retaining the ...
... at the expense of a 0(N 2 ) computational  complexity 
A Pipelined Kalman Filter Architecture
A Pipelined Kalman Filter Architecture
Shanbhag, Naresh R.; Parhi, Keshab K.
, where N is the filter order. ...
... a comprehensive picture of trans-genome  complexity 
Protocols for Chromosome-Mediated Gene Transfer
Protocols for Chromosome-Mediated Gene Transfer
Porteous, David J.
, organization, and origin. ...
... This study focused on  complexity 
Complexity of the self-schema and responses to disconfirming feedback
Complexity of the self-schema and responses to disconfirming feedback
Farchaus Stein, Karen
of the self-schema as one factor that ...
... describes a new technique for reducing the  complexity 
Complexity reduction using expansive coding
Complexity reduction using expansive coding
Beasley, David; Bull, David R.; Martin, Ralph R.
of algorithms, such as those used in ...
... between descriptional and computational  complexities 
Comparing descriptional and computational complexity of infinite words
Comparing descriptional and computational complexity of infinite words
Hromkovič, Juraj; Karhumäki, Juhani; Lepistö, Arto
of infinite words. ...