Search
Now showing items 1-10 of 3954
Behavioural Explanation in the Realm of Non-mental Computing Agents
(Springer, 2015)
Recently, many philosophers have been inclined to ascribe mentality to
animals (including some insects) on the main grounds that they possess certain
complex computational abilities. In this paper I contend that this ...
Computational intelligence in remote sensing: an editorial
(MDPI, 2020)
Computational intelligence is a very active and fruitful research of artificial intelligence with a broad spectrum of applications. Remote sensing data has been a salient field of application of computational intelligence ...
The school of arts and trades in Santiago (EAO), 1849–1977
(MIT Press, 2016)
Propiedades básicas de los números computables.
(2011-10-13)
Motivados por la Teoría Algorítmica de la Información, estudiamos el campo [C.sub.c] de los números complejos computables. Presentamos ejemplos no triviales de números reales tanto computables como no computables y proponemos ...
Computing coverage kernels under restricted settings
(Springer Verlag, 2018)
We consider the Minimum Coverage Kernel problem: given a set B of d-dimensional boxes, find a subset of B of minimum size covering the same region as B. This problem is NP -hard, but as for many NP -hard problems on graphs, ...
Depth distribution in high dimensions
(Springer, 2017)
Motivated by the analysis of range queries in databases, we introduce the computation of the Depth Distribution of a set mathcal {B} of axis aligned boxes, whose computation generalizes that of the Klee’s Measure and of ...
Exploiting computation-friendly graph compression methods for adjacency-matrix multiplication
(Institute of Electrical and Electronics Engineers Inc., 2018)
Computing the product of the (binary) adjacency matrix of a large graph with a real-valued vector is an important operation that lies at the heart of various graph analysis tasks, such as computing PageRank. In this paper ...
Delay approximations for correlation measurements using analog computers
(1965)
-In the most direct method for measuring correlation functions with an analog computer a delay must be simulated. Since a lumped parameter system is used, we can only hope to approximate this delay. We intentionally exclude ...
Allowing Each Node to Communicate Only Once in a Distributed System: Shared Whiteboard Models
(Springer, 2015)
In this paper we study distributed algorithms on massive
graphs where links represent a particular relationship between
nodes (for instance, nodes may represent phone numbers
and links may indicate telephone calls). ...