Sciweavers

4074 search results - page 660 / 815
» Defining Computational Aesthetics
Sort
View
ECEASST
2008
88views more  ECEASST 2008»
15 years 4 months ago
Parsing of Hyperedge Replacement Grammars with Graph Parser Combinators
: Graph parsing is known to be computationally expensive. For this reason the construction of special-purpose parsers may be beneficial for particular graph languages. In the domai...
Steffen Mazanek, Mark Minas
ENTCS
2008
175views more  ENTCS 2008»
15 years 4 months ago
AGAPIA v0.1: A Programming Language for Interactive Systems and Its Typing System
A model (consisting of rv-systems), a core programming language (for developing rv-programs), several specification and analysis techniques appropriate for modeling, programming a...
Cezara Dragoi, Gheorghe Stefanescu
FAC
2008
100views more  FAC 2008»
15 years 4 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
BMCBI
2006
180views more  BMCBI 2006»
15 years 4 months ago
Building multiclass classifiers for remote homology detection and fold recognition
Motivation Protein remote homology prediction and fold recognition are central problems in computational biology. Supervised learning algorithms based on support vector machines a...
Huzefa Rangwala, George Karypis
IANDC
2008
84views more  IANDC 2008»
15 years 4 months ago
A theory of system behaviour in the presence of node and link failure
We develop a behavioural theory of distributed programs in the presence of failures such as nodes crashing and links breaking. The framework we use is that of D, a language in whi...
Adrian Francalanza, Matthew Hennessy