2186 search results - page 40 / 438 » Considering an Organization's Memory |
AMKM
2003
Springer
14 years 29 days ago
2003
Springer
In this article we describe a computational architecture called MC2 that brings together a set of tools that contribute to the knowledge management process by allowing for the cre...
IFL
2001
Springer
14 years 5 days ago
2001
Springer
Map- and fold-like skeletons are a suitable abstractions to guide parallel program execution in functional array processing. However, when it comes to achieving high performance, i...
IJON
2006
13 years 7 months ago
2006
The goal of the visual correspondence problem is to establish a connectivity pattern (a mapping) between two images such that features projected from the same scene point are conn...
HPCC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
ASAP
1997
IEEE
13 years 12 months ago
1997
IEEE
This paper introduces a powerful novel sequencer for controlling computational machines and for structured DMA (direct memory access) applications. It is mainly focused on applica...