Sciweavers

5675 search results - page 234 / 1135
» Exploiting Chaos for Computation
Sort
View
ICS
1992
Tsinghua U.
15 years 11 months ago
Optimizing for parallelism and data locality
Previous research has used program transformation to introduce parallelism and to exploit data locality. Unfortunately,these twoobjectives have usuallybeen considered independentl...
Ken Kennedy, Kathryn S. McKinley
COMPLEX
2009
Springer
15 years 11 months ago
Community Identification in Directed Networks
The most common approach to community identification of directed networks has been to ignore edge directions and apply methods developed for undirected networks. Recently, Leicht a...
Youngdo Kim, Seung-Woo Son, Hawoong Jeong
DSN
2004
IEEE
15 years 11 months ago
Efficient Byzantine-Tolerant Erasure-Coded Storage
This paper describes a decentralized consistency protocol for survivable storage that exploits local data versioning within each storage-node. Such versioning enables the protocol...
Garth R. Goodson, Jay J. Wylie, Gregory R. Ganger,...
EUROPAR
1995
Springer
15 years 10 months ago
Relating Data-Parallelism and (And-) Parallelism in Logic Programs
Much work has been done in the areas of and–parallelism and data parallelism in Logic Programs. Such work has proceeded to a certain extent in an independent fashion. Both types...
Manuel V. Hermenegildo, Manuel Carro
BMVC
2002
15 years 9 months ago
Detecting Planes In An Uncalibrated Image Pair
Plane detection is a prerequisite to a wide variety of vision tasks. This paper proposes a novel method that exploits results from projective geometry to automatically detect plan...
Manolis I. A. Lourakis, Antonis A. Argyros, Stelio...