4353 search results - page 90 / 871 » Expressiveness of Process Algebras |
119
click to vote
LISP
2006
15 years 3 months ago
2006
In this paper we survey some well-known approaches proposed as general models for calculi dealing with names (like for example process calculi with name-passing). We focus on (pre)...
213
Voted
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
Traditional approaches to rule-based information extraction (IE) have primarily been based on regular expression grammars. However, these grammar-based systems have difficulty scal...
140
click to vote
TLCA
2007
Springer
15 years 10 months ago
2007
Springer
Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type, it provides a fold combinator encapsulating struc...
137
Voted
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Field theory is an area in physics with a deceptively compact notation. Although general purpose computer algebra systems, built around generic list-based data structures, can be ...
109
click to vote
JMIV
2010
15 years 2 months ago
2010
In this paper, we present a novel algorithm that combines the power of expression of Geometric Algebra with the robustness of Tensor Voting to find the correspondences between two...