9405 search results - page 443 / 1881 » Computing a Model of Set Theory |
163
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we address the verification problem of ordered multi-pushdown systems: A multistack extension of pushdown systems that comes with a constraint on stack operations s...
211
click to vote
NDJFL
2010
15 years 1 months ago
2010
The question of the origin of polyadic expressivity is explored and the results are brought to bear on Bertrand Russell's 1903 theory of denoting concepts, which is the main o...
178
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
212
click to vote
CVPR
2003
IEEE
16 years 5 days ago
2003
IEEE
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
160
click to vote
ICDS
2009
IEEE
16 years 1 months ago
2009
IEEE
Existing traffic flow modeling theory lacks of guidelines to construct traffic flow models from scratch. In addition, traffic flow models are mainly analyzed with computer simulat...