Sciweavers

7195 search results - page 637 / 1439
» On Computing Power
Sort
View
JGAA
2007
135views more  JGAA 2007»
15 years 7 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
STACS
2012
Springer
14 years 2 months ago
Stabilization of Branching Queueing Networks
Queueing networks are gaining attraction for the performance analysis of parallel computer systems. A Jackson network is a set of interconnected servers, where the completion of a...
Tomás Brázdil, Stefan Kiefer
LATIN
1998
Springer
15 years 11 months ago
The CREW PRAM Complexity of Modular Inversion
One of the long-standing open questions in the theory of parallel computation is the parallel complexity of the integer gcd and related problems, such as modular inversion. We pres...
Joachim von zur Gathen, Igor Shparlinski
ITS
1992
Springer
120views Multimedia» more  ITS 1992»
15 years 11 months ago
Distributed Learning Companion System: WEST Revisited
This paper describes a distributed learning system which consists of two connected computers so that students can learn in collaboration and/or competition at different locations. ...
Tak-Wai Chan, I-Ling Chung, Rong-Guey Ho, Wen-Juan...
CIE
2009
Springer
15 years 11 months ago
Functions Definable by Arithmetic Circuits
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...
Ian Pratt-Hartmann, Ivo Düntsch