Sciweavers

268 search results - page 49 / 54
» Expressive Power of Grammatical Formalisms
Sort
View
AISC
1998
Springer
13 years 11 months ago
Reasoning About Coding Theory: The Benefits We Get from Computer Algebra
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
Clemens Ballarin, Lawrence C. Paulson
BMCBI
2005
126views more  BMCBI 2005»
13 years 7 months ago
An algorithm for automatic evaluation of the spot quality in two-color DNA microarray experiments
Background: Although DNA microarray technologies are very powerful for the simultaneous quantitative characterization of thousands of genes, the quality of the obtained experiment...
Eugene Novikov, Emmanuel Barillot
JSC
2010
103views more  JSC 2010»
13 years 5 months ago
Anti-patterns for rule-based languages
Negation is intrinsic to human thinking and most of the time when searching for something, we base our patterns on both positive and negative conditions. This should be naturally ...
Horatiu Cirstea, Claude Kirchner, Radu Kopetz, Pie...
WWW
2006
ACM
14 years 8 months ago
Relaxed: on the way towards true validation of compound documents
To maintain interoperability in the Web environment it is necessary to comply with Web standards. Current specifications of HTML and XHTML languages define conformance conditions ...
Jirka Kosek, Petr Nálevka
ICFP
2009
ACM
14 years 8 months ago
A concurrent ML library in concurrent Haskell
rrent ML, synchronization abstractions can be defined and passed as values, much like functions in ML. This mechanism admits a powerful, modular style of concurrent programming, c...
Avik Chaudhuri