Sciweavers

1011 search results - page 200 / 203
» The three dimensions of proofs
Sort
View
92
Voted
CORR
2006
Springer
120views Education» more  CORR 2006»
14 years 9 months ago
Termination orders for 3-dimensional rewriting
Abstract: This paper studies 3-polygraphs as a framework for rewriting on two-dimensional words. A translation of term rewriting systems into 3-polygraphs with explicit resource ma...
Yves Guiraud
BMCBI
2007
110views more  BMCBI 2007»
14 years 9 months ago
Interpretation of multiple probe sets mapping to the same gene in Affymetrix GeneChips
Background: Affymetrix GeneChip technology enables the parallel observations of tens of thousands of genes. It is important that the probe set annotations are reliable so that bio...
Maria A. Stalteri, Andrew P. Harrison
IANDC
2007
107views more  IANDC 2007»
14 years 9 months ago
Task automata: Schedulability, decidability and undecidability
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
Elena Fersman, Pavel Krcál, Paul Pettersson...
CORR
2002
Springer
166views Education» more  CORR 2002»
14 years 9 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck
JCSS
2000
121views more  JCSS 2000»
14 years 9 months ago
The Closure of Monadic NP
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...
Miklós Ajtai, Ronald Fagin, Larry J. Stockm...