882 search results - page 96 / 177 » On self-embeddings of computable linear orderings |
ICS
1999
Tsinghua U.
15 years 2 months ago
1999
Tsinghua U.
Programming languages that provide multidimensional arrays and a flat linear model of memory must implement a mapping between these two domains to order array elements in memory....
102
click to vote
CONCUR
1997
Springer
15 years 2 months ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
CONEXT
2007
ACM
15 years 1 months ago
2007
ACM
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
131
click to vote
ICPP
1995
IEEE
15 years 1 months ago
1995
IEEE
– In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller gra...
107
click to vote
ECCV
2010
Springer
15 years 1 months ago
2010
Springer
We introduce a new descriptor for images which allows the construction of efficient and compact classifiers with good accuracy on object category recognition. The descriptor is the...