Sciweavers

11017 search results - page 1906 / 2204
» Closure Systems and their Structure
Sort
View
ICCV
1995
IEEE
15 years 11 months ago
Object Indexing Using an Iconic Sparse Distributed Memory
A general-purpose object indexingtechnique is described that combines the virtues of principal component analysis with the favorable matching properties of high-dimensional spaces...
Rajesh P. N. Rao, Dana H. Ballard
LICS
1997
IEEE
15 years 11 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
KDD
1995
ACM
67views Data Mining» more  KDD 1995»
15 years 11 months ago
A Perspective on Databases and Data Mining
We discuss the use of database met hods for data mining. Recently impressive results have been achieved for some data mining problems using highly specialized and clever data stru...
Marcel Holsheimer, Martin L. Kersten, Heikki Manni...
SC
1995
ACM
15 years 11 months ago
A Novel Approach Towards Automatic Data Distribution
: Data distribution is one of the key aspects that a parallelizing compiler for a distributed memory architecture should consider, in order to get efficiency from the system. The ...
Jordi Garcia, Eduard Ayguadé, Jesús ...
SC
1995
ACM
15 years 11 months ago
A Performance Evaluation of the Convex SPP-1000 Scalable Shared Memory Parallel Computer
The Convex SPP-1000 is the first commercial implementation of a new generation of scalable shared memory parallel computers with full cache coherence. It employs a hierarchical s...
Thomas L. Sterling, Daniel Savarese, Peter MacNeic...
« Prev « First page 1906 / 2204 Last » Next »