Sciweavers

4131 search results - page 74 / 827
» Compactness in Topology and Computation
Sort
View
LCN
2005
IEEE
15 years 11 months ago
Fault Tolerant Active Rings for Structured Peer-to-Peer Overlays
Algorithms by which peers join and leave structured overlay networks can be classified as passive or active. Passive topology maintenance relies on periodic background repair of n...
John Risson, Ken Robinson, Tim Moors
CIE
2005
Springer
15 years 11 months ago
Computability in Computational Geometry
We promote the concept of object directed computability in computational geometry in order to faithfully generalise the wellestablished theory of computability for real numbers and...
Abbas Edalat, Ali Asghar Khanban, André Lie...
FCCM
2009
IEEE
204views VLSI» more  FCCM 2009»
15 years 10 months ago
Acceleration and Energy Efficiency of a Geometric Algebra Computation using Reconfigurable Computers and GPUs
Geometric algebra (GA) is a mathematical framework that allows the compact description of geometric relationships and algorithms in many fields of science and engineering. The exe...
Holger Lange, Florian Stock, Andreas Koch, Dietmar...
JUCS
2002
79views more  JUCS 2002»
15 years 5 months ago
Some Notes on Fine Computability
: A metric defined by Fine induces a topology on the unit interval which is strictly stronger than the ordinary Euclidean topology and which has some interesting applications in Wa...
Vasco Brattka
ISCA
2012
IEEE
280views Hardware» more  ISCA 2012»
13 years 8 months ago
A case for random shortcut topologies for HPC interconnects
—As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance C...
Michihiro Koibuchi, Hiroki Matsutani, Hideharu Ama...