279 search results - page 44 / 56 » A Name Abstraction Functor for Named Sets |
117
click to vote
MFCS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We introduce a natural class of cellular automata characterised by a property of the local transition law without any assumption on the states set. We investigate some al...
162
click to vote
WADS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
102
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. We introduce a natural class of cellular automata characterised by a property of the local transition law without any assumption on the states set. We investigate some al...
IJCAI
2007
15 years 3 months ago
2007
Traditionally, Information Extraction (IE) has focused on satisfying precise, narrow, pre-specified requests from small homogeneous corpora (e.g., extract the location and time o...
129
Voted
ICFP
2005
ACM
16 years 1 months ago
2005
ACM
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...