MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "A Complexity Measure." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

539 documents found, showing 1 through 10. Next 10 →

ATOM

A Complexity Measure for Diachronic Chinese Phonology
by Anand Raman, John Newman, Jon Patrick, Palmerston North, Palmerston North, Palmerston North
…A Complexity Measure for Diachronic Chinese Phonology Anand Raman Computer Science Massey…
Cited by 1 (0 self) – Add To MetaCart

A Complexity Measure for Diachronic Chinese Phonology
by Artand Raman Computer, Anand Raman, Palmerston North — 1997 — In Proceedings of the SIGPHON97 workshop on computational linguistics at the ACL'97/EACL'97 joint conference
…A Complexity Measure for Diachronic Chinese Phonology Anand Raman Computer Science Massey…
Add To MetaCart

Finding a Complexity Measure for Business Process Models
by Antti Latva-Koivisto — 2001
…HELSINKI UNIVERSITY OF TECHNOLOGY Systems Analysis Laboratory Finding a complexity measure…
Cited by 3 (0 self) – Add To MetaCart

A Measure of Semantic Complexity for Natural Language Systems
by Shannon Pollard And, Shannon Pollard, Alan W. Biermann — 2000 — Workshop on Syntactic and Semantic Complexity in Natural Language Processing Systems. ANLP-NAACL2000
…A Measure of Semantic Complexity for Natural Language Systems Shannon Pollard and Alan W…
Add To MetaCart

Lower Bounds on Arithmetic Circuits via Partial Derivatives
by Noam Nisan, Noam Nisan, Avi Widgerson, Avi Wigderson — 1995 — Computational Complexity
… classes of nonmonotone arithmetic circuits. The heart of this technique is a complexity measure…
Cited by 22 (2 self) – Add To MetaCart

Complexity Measures For Programming Languages
by Leonard T. Goodman, Leonard I. Goodman — 1971
… MEASURES FOR PROGRAMMING LANGUAGES* Leonard I. Goodman Abstract A theory of complexity is developed…
Add To MetaCart

The Average Case Complexity of the Parallel Prefix Problem
by Andreas Jakoby, Christian Schindelhauer, Rüdiger Reischuk, Stephan Weis, Technische Hochschule Darmstadt — 1994 — in "Proceedings 21st International Colloquium, Automata, Languages and Programming
…. As computational model circuits over the semigroup are used and a complexity measure for the average delay…
Cited by 2 (2 self) – Add To MetaCart

The Average Case Complexity of the Parallel Prefix Problem
by Andreas Jakoby Christian, Christian Schindelhauer, Rudiger Reischuk, Stephan Weis, Technische Hochschule Darmstadt — 1994 — in "Proceedings 21st International Colloquium, Automata, Languages and Programming
…. As computational model circuits over the semigroup are used and a complexity measure for the average delay…
Add To MetaCart

Bayesian Optimization Algorithm, Decision Graphs, and Occam's Razor
by Martin Pelikan, David. E. Goldberg, Kumara Sastry — 2001 — Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), 519–526. Also IlliGAL
… models, a complexity measure is incorporated into the Bayesian-Dirichlet metric for Bayesian networks…
Cited by 25 (10 self) – Add To MetaCart

An Information Theory Framework for the Analysis of Scene Complexity
by Miquel Feixas, Esteve Del Acebo, Philippe Bekaert, Mateu Sbert — 1999
… complexity. We introduce a number of complexity measures from information theory quantifying how difficult…
Cited by 12 (8 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB