Results 231 to 240 of about 2,734,579 (285)
Some of the next articles are maybe not open access.
On distributing the clustering process
Pattern Recognition Letters, 2002Summary: Clustering algorithms require a large amount of computations of distances among patterns and centers of clusters. Hence, their complexity is dominated by the number of patterns. On the other hand, there is an explosive growth of business or scientific databases storing huge volumes of data.
Basilis Boutsinas, T. Gnardellis
openaire +2 more sources
DISTRIBUTED PROCESSING IN AUTOMATA
International Journal of Foundations of Computer Science, 1999With distributed computing beginning to play a major role in modern Computer Science, the theory of grammar systems and distributed automata has been developed in order to model distributed computing. In this paper, we introduce the notion of distributed automata in the sequential sense.
Kamala Krithivasan +2 more
openaire +1 more source
On the distribution of Verhulst process
Lithuanian Mathematical Journal, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jakubowski, Jacek, Wiśniewolski, Maciej
openaire +2 more sources
A Logic For Distributed Processes
Mathematical Logic Quarterly, 1989This paper was inspired by the problem of finding a procedure for (1) deciding whether or not a given function can be computed in a given synchronous bit-processing architecture, and if computable (2) constructing a program which will compute the function.
openaire +2 more sources
Concurrency and Computation: Practice and Experience, 2005
AbstractA programming model called distributed filter processes for transparent filtering in distributed systems is presented. Filter processes are modeled as extensions to distributed processes. Messages can be captured transparently by intermediate filter processes.
openaire +2 more sources
AbstractA programming model called distributed filter processes for transparent filtering in distributed systems is presented. Filter processes are modeled as extensions to distributed processes. Messages can be captured transparently by intermediate filter processes.
openaire +2 more sources
Distribution of Sequential Processes
2005We present a solution to the distribution problem, in a particular framework: how to transform a set of sequential processes into a set of respectively equivalent concurrent processes? The models of systems are finite automata in the non-distributed case and some collection of finite automata with synchronization in the distributed case.
Joffroy Beauquier, Antoine Petit 0001
openaire +1 more source
Distributing the software process
Proceedings of 1996 Australian Software Engineering Conference, 2002This paper sees software development as made up of two important parts. One is the technical work in producing software. The other is the team management and coordination in large and complex systems. Support tools for software development have in general concentrated on providing technical support to improve task productivity. These have included CASE
Igor T. Hawryszkiewycz, Ian Gorton
openaire +1 more source
Control of Distributed Processes
Computer, 1978Cost-effective control of distributed computing systems requires practical models for reassigning program modules among the processors in real time.
Harold S. Stone, Shahid H. Bokhari
openaire +1 more source
Distributed quadtree processing
1990Quadtrees have been widely used in computer vision, spatial database, and related area due to their compactness and regularity. It has long been claimed that quadtree related algorithms are suitable for parallel and distributed implementation, but only little work has been done to justify this claim.
C. H. Chien, Takeo Kanade
openaire +1 more source
Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181), 2002
This paper explores issues arising from designing digital signal processing algorithms for dynamically-varying computing environments such as an unreliable network of processors. We present a language for specifying signal processing algorithms which permits the execution path of the algorithm to be dynamically chosen. The language leads naturally to a
Li Lee, Alan V. Oppenheim
openaire +1 more source
This paper explores issues arising from designing digital signal processing algorithms for dynamically-varying computing environments such as an unreliable network of processors. We present a language for specifying signal processing algorithms which permits the execution path of the algorithm to be dynamically chosen. The language leads naturally to a
Li Lee, Alan V. Oppenheim
openaire +1 more source