9405 search results - page 96 / 1881 » Computing a Model of Set Theory |
SODA
2000
ACM
14 years 11 months ago
2000
ACM
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
ACMDIS
2004
ACM
15 years 3 months ago
2004
ACM
In this paper we discuss a real world problem encountered during recent fieldwork: that of providing information in public settings when the information has both public and privat...
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
Concurrent compositions of recursive programs with finite a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form ...
ISVC
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Linear systems and eigen-calculations on symmetric diagonally dominant matrices (SDDs) occur ubiquitously in computer vision, computer graphics, and machine learning. In ...
EMSOFT
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We classify component-based models of computation into component models and interface models. A component model speci es for each component how the component behaves in a...