4926 search results - page 482 / 986 » Two Graph Algorithms On an Associative Computing Model |
152
click to vote
CAIP
2005
Springer
15 years 9 months ago
2005
Springer
Non-parametric data representation can be done by means of a potential function. This paper introduces a methodology for finding modes of the potential function. Two different me...
149
click to vote
KDD
2001
ACM
16 years 4 months ago
2001
ACM
The similarity join is an important operation for mining high-dimensional feature spaces. Given two data sets, the similarity join computes all tuples (x, y) that are within a dis...
172
click to vote
LOGCOM
1998
15 years 3 months ago
1998
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
132
click to vote
ICPR
2000
IEEE
15 years 8 months ago
2000
IEEE
This paper presents a new technique for approximating range images by means of adaptive triangular meshes with a bounded approximation error and without applying optimization. Thi...
113
Voted
ASPDAC
2010
ACM
15 years 1 months ago
2010
ACM
- In this paper, we propose a novel and global A3MAP (Architecture-Aware Analytic Mapping) algorithm applied to NoC (Networks-on-Chip) based MPSoC (Multi-Processor System-on-Chip) ...