We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
Abstract. This article introduces structural aspects in an ontology of approximate reason. The basic assumption in this ontology is that approximate reason is a capability of an ag...
James F. Peters, Andrzej Skowron, Jaroslaw Stepani...
Due to their simplicity and flexibility, polygonal meshes are about to become the standard representation for surface geometry in computer graphics applications. Some algorithms i...
—This paper provides a complete characterization of stationary Markov random fields on a finite rectangular (nontoroidal) lattice in the basic case of a second-order neighborho...
This paper follows a formal approach to information retrieval based on statistical language models. By introducing some simple reformulations of the basic language modeling approa...