schliessen

Filtern

 

Bibliotheken

Cover Image

A Fast Algorithm for k-Nearest Neighbor Problem on a Reconfigurable Mesh Computer

Given a set S of m points stored on a reconfigurable mesh computer of size n×n, one point per processing element (PE). In this paper we present a parallel method for solving the k-Nearest Neighbor problem (k-NN). This method permits each point of S to know its k-NN (0

Journal Title: Journal of intelligent & robotic systems 2001-11-01, Vol.32 (3), p.347-360
Main Author: Bouattane, O
Other Authors: Elmesbahi, J , Khaldoun, M , Rami, A
Format: Electronic Article Electronic Article
Language: English
Subjects:
Algorithms
Complexity
Mathematical models
Polyethylenes
Processors
Reconfiguration
Registers
Stores
Publisher: Dordrecht: Springer Nature B.V
ID: ISSN: 0921-0296
Zum Text:
SendSend as email Add to Book BagAdd to Book Bag
Staff View
recordid: cdi_proquest_miscellaneous_1671418118
title: A Fast Algorithm for k-Nearest Neighbor Problem on a Reconfigurable Mesh Computer
format: Article
creator:
  • Bouattane, O
  • Elmesbahi, J
  • Khaldoun, M
  • Rami, A
subjects:
  • Algorithms
  • Complexity
  • Mathematical models
  • Polyethylenes
  • Processors
  • Reconfiguration
  • Registers
  • Stores
ispartof: Journal of intelligent & robotic systems, 2001-11-01, Vol.32 (3), p.347-360
description: Given a set S of m points stored on a reconfigurable mesh computer of size n×n, one point per processing element (PE). In this paper we present a parallel method for solving the k-Nearest Neighbor problem (k-NN). This method permits each point of S to know its k-NN (0
language: eng
source:
identifier: ISSN: 0921-0296
fulltext: no_fulltext
issn:
  • 0921-0296
  • 1573-0409
url: Link


@attributes
NO1
SEARCH_ENGINEprimo_central_multiple_fe
SEARCH_ENGINE_TYPEPrimo Central Search Engine
RANK1.7820629
LOCALfalse
PrimoNMBib
record
control
sourceidproquest
recordidTN_cdi_proquest_miscellaneous_1671418118
sourceformatXML
sourcesystemPC
sourcerecordid2420141911
originalsourceidFETCH-LOGICAL-p228t-279a384a12de877892d0ad57343407b6533340650201761c4f29c6ee1117d1700
addsrcrecordideNpdkE1LxDAQQIMouK6evQZPXqozSdok3sriqrCuH-i5pG267do2a9L-fwN68jTD4zE8hpBLhBsExm_zOwTkmgHnjGs4IgtMJU9AgD4mC9AME2A6OyVnIewBQKtUL8hbTtcmTDTvd853UzvQxnn6lWyt8Tbyre12bRnRq3dlbwfqRmrou63c2HS72ZsI6bMNLV254TBP1p-Tk8b0wV78zSX5XN9_rB6TzcvD0yrfJAfG1JQwqQ1XwiCrrZJSaVaDqWOx4AJkmaWcxyVLgQHKDCvRMF1l1iKirFECLMn1792Dd99zbC2GLlS2781o3RwKzCQKVIgqqlf_1L2b_RjrCqWiJ9L4sB9x4lvT
sourcetypeAggregation Database
isCDItrue
recordtypearticle
pqid881674539
display
typearticle
titleA Fast Algorithm for k-Nearest Neighbor Problem on a Reconfigurable Mesh Computer
creatorBouattane, O ; Elmesbahi, J ; Khaldoun, M ; Rami, A
creatorcontribBouattane, O ; Elmesbahi, J ; Khaldoun, M ; Rami, A
descriptionGiven a set S of m points stored on a reconfigurable mesh computer of size n×n, one point per processing element (PE). In this paper we present a parallel method for solving the k-Nearest Neighbor problem (k-NN). This method permits each point of S to know its k-NN (0
identifier
0ISSN: 0921-0296
1EISSN: 1573-0409
2DOI: 10.1023/A:1013920332390
languageeng
publisherDordrecht: Springer Nature B.V
subjectAlgorithms ; Complexity ; Mathematical models ; Polyethylenes ; Processors ; Reconfiguration ; Registers ; Stores
ispartofJournal of intelligent & robotic systems, 2001-11-01, Vol.32 (3), p.347-360
rightsKluwer Academic Publishers 2001
lds50peer_reviewed
links
openurl$$Topenurl_article
thumbnail$$Usyndetics_thumb_exl
search
creatorcontrib
0Bouattane, O
1Elmesbahi, J
2Khaldoun, M
3Rami, A
title
0A Fast Algorithm for k-Nearest Neighbor Problem on a Reconfigurable Mesh Computer
1Journal of intelligent & robotic systems
descriptionGiven a set S of m points stored on a reconfigurable mesh computer of size n×n, one point per processing element (PE). In this paper we present a parallel method for solving the k-Nearest Neighbor problem (k-NN). This method permits each point of S to know its k-NN (0
subject
0Algorithms
1Complexity
2Mathematical models
3Polyethylenes
4Processors
5Reconfiguration
6Registers
7Stores
issn
00921-0296
11573-0409
fulltextfalse
rsrctypearticle
creationdate2001
recordtypearticle
recordideNpdkE1LxDAQQIMouK6evQZPXqozSdok3sriqrCuH-i5pG267do2a9L-fwN68jTD4zE8hpBLhBsExm_zOwTkmgHnjGs4IgtMJU9AgD4mC9AME2A6OyVnIewBQKtUL8hbTtcmTDTvd853UzvQxnn6lWyt8Tbyre12bRnRq3dlbwfqRmrou63c2HS72ZsI6bMNLV254TBP1p-Tk8b0wV78zSX5XN9_rB6TzcvD0yrfJAfG1JQwqQ1XwiCrrZJSaVaDqWOx4AJkmaWcxyVLgQHKDCvRMF1l1iKirFECLMn1792Dd99zbC2GLlS2781o3RwKzCQKVIgqqlf_1L2b_RjrCqWiJ9L4sB9x4lvT
startdate20011101
enddate20011101
creator
0Bouattane, O
1Elmesbahi, J
2Khaldoun, M
3Rami, A
generalSpringer Nature B.V
scope
03V.
17SC
27SP
37TB
47XB
58AL
68FD
78FE
88FG
98FK
10ABJCF
11ABUWG
12ARAPS
13AZQEC
14BENPR
15BGLVJ
16DWQXO
17FR3
18GNUQQ
19HCIFZ
20JQ2
21K7-
22L6V
23L7M
24L~C
25L~D
26M0N
27M7S
28P5Z
29P62
30PQEST
31PQQKQ
32PQUKI
33PTHSS
34Q9U
35F28
sort
creationdate20011101
titleA Fast Algorithm for k-Nearest Neighbor Problem on a Reconfigurable Mesh Computer
authorBouattane, O ; Elmesbahi, J ; Khaldoun, M ; Rami, A
facets
frbrtype5
frbrgroupidcdi_FETCH-LOGICAL-p228t-279a384a12de877892d0ad57343407b6533340650201761c4f29c6ee1117d1700
rsrctypearticles
prefilterarticles
languageeng
creationdate2001
topic
0Algorithms
1Complexity
2Mathematical models
3Polyethylenes
4Processors
5Reconfiguration
6Registers
7Stores
toplevelpeer_reviewed
creatorcontrib
0Bouattane, O
1Elmesbahi, J
2Khaldoun, M
3Rami, A
collection
0ProQuest Central (Corporate)
1Computer and Information Systems Abstracts
2Electronics & Communications Abstracts
3Mechanical & Transportation Engineering Abstracts
4ProQuest Central (purchase pre-March 2016)
5Computing Database (Alumni Edition)
6Technology Research Database
7ProQuest SciTech Collection
8ProQuest Technology Collection
9ProQuest Central (Alumni) (purchase pre-March 2016)
10Materials Science & Engineering Collection
11ProQuest Central (Alumni Edition)
12Advanced Technologies & Aerospace Collection
13ProQuest Central Essentials
14ProQuest Central
15Technology Collection
16ProQuest Central Korea
17Engineering Research Database
18ProQuest Central Student
19SciTech Premium Collection
20ProQuest Computer Science Collection
21Computer Science Database
22ProQuest Engineering Collection
23Advanced Technologies Database with Aerospace
24Computer and Information Systems Abstracts – Academic
25Computer and Information Systems Abstracts Professional
26Computing Database
27Engineering Database
28Advanced Technologies & Aerospace Database
29ProQuest Advanced Technologies & Aerospace Collection
30ProQuest One Academic Eastern Edition
31ProQuest One Academic
32ProQuest One Academic UKI Edition
33Engineering Collection
34ProQuest Central Basic
35ANTE: Abstracts in New Technology & Engineering
jtitleJournal of intelligent & robotic systems
delivery
delcategoryRemote Search Resource
fulltextno_fulltext
addata
au
0Bouattane, O
1Elmesbahi, J
2Khaldoun, M
3Rami, A
formatjournal
genrearticle
ristypeJOUR
atitleA Fast Algorithm for k-Nearest Neighbor Problem on a Reconfigurable Mesh Computer
jtitleJournal of intelligent & robotic systems
date2001-11-01
risdate2001
volume32
issue3
spage347
epage360
pages347-360
issn0921-0296
eissn1573-0409
abstractGiven a set S of m points stored on a reconfigurable mesh computer of size n×n, one point per processing element (PE). In this paper we present a parallel method for solving the k-Nearest Neighbor problem (k-NN). This method permits each point of S to know its k-NN (0
copDordrecht
pubSpringer Nature B.V
doi10.1023/A:1013920332390