Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

John Kennedy

dblp:62/6136 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
0since 2021 · last 2018
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2Security and privacy · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Indexing and storage engines · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware accelerators and domain-specific architectures · 77% Emerging computing paradigms · 23%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Indexing and storage engines
multidimensional clustering
0.112007
Efficient Bulk Deletes for Multi Dimensionally Clustered Tables in DB2 · VLDB 2007
Algorithms and data structures › similarity search › nearest neighbor search
k-NN classification
0.011998
A High Performance k-NN Classifier Using a Binary Correlation Matrix Memory · NIPS 1998
Algorithms and data structures › similarity search
nearest neighbor search
0.011998
A High Performance k-NN Classifier Using a Binary Correlation Matrix Memory · NIPS 1998
Emerging computing paradigms › neuromorphic computing
associative memory
0.011998
A High Performance k-NN Classifier Using a Binary Correlation Matrix Memory · NIPS 1998

Methods — techniques the papers use, named apart from their topics

binary correlation matrix memory · 0.0
YearPublicationVenuePosition
2018 Optimizing the Placement of Data Collection Services on Vehicle Clusters
abstract
Vehicles are an important source of data, with embedded sensors including built-in cameras. Their data can be processed close to where it was generated, using computation and network resources on collaborating vehicles. Processing at the network edge helps to reduce end-to-end service latencies. However, such mobile virtual resource pools require effective management, especially if those resources are to be leased to third-party service providers. We address the problem of service placement on moving, connected, vehicle nodes (V2V) supported by roadside infrastructure (V2I). We formulate a distributed service model and optimize the placement of services, subject to constraints related to node resource capacity, link capacity, distributed application deployment (full deployment, anti-collocation and adjacency constraint) and vehicle mobility.
Kanika Sharma, Bernard Butler, Brendan Jennings, John Kennedy, Radhika Loomba
PIMRC4
2016 SLAaaS: an OCCI Compliant Framework for Cloud SLA Provisioning and Violation Detection
abstract
SLAs are an integral part of all modern service provisioning operations. They have been a topic of discussion, research and development for many years but still the norm is the use of rigid, complex and not easy to automate Service Level Agreements. In this paper we are presenting a service framework that is leveraging the OCCI specification in order to facilitate standardized SLA provisioning and violation detection. This SLA as a Service (SLAaaS) offering is provided as an open source framework to any Service Provider that wants to efficiently enhance his infrastructure with SLA support.
Gregory Katsaros, Thijs Metsch, John Kennedy
CLOSER (2)3
2010 Sensor Networks used in an Electrical Engineering Capstone Projects Course
R. Lal Tummala, John Kennedy
CAINE2
2007 Efficient Bulk Deletes for Multi Dimensionally Clustered Tables in DB2
Bishwaranjan Bhattacharjee, Timothy Malkemus, Sherman Lau, Sean Mckeough, Jo-Anne Kirton, Robin Von Boeschoten, John Kennedy
VLDB7
2000 Key Recovery Functional Model
John Kennedy, Stephen M. Matyas, Nevenko Zunic
Comput. Secur.1
1998 A Binary Correlation Matrix Memory k-NN Classifier with Hardware Implementation
abstract
This paper describes a generic and fast classifier that uses a binary CMM (Correlation Matrix Memory) neural network for storing and matching a large amount of patterns efficiently, and a k-NN rule for classification. To meet CMM input requirements, a robust encoding method is proposed to convert numerical inputs into binary ones with the maximally achievable uniformity. To reduce the execution bottleneck, a hardware implementation of the CMM is described, which shows the network with on-board training and testing operates at over 200 times the speed of a current mid-range workstation, and is scaleable to very large problems. The CMM classifier has been tested on several benchmarks and, comparing with a simple k-NN classifier, it gave less than 1 % lower accuracy and over 4 and 12 times speed-ups in software and hardware respectively. 1
Jim Austin, John Kennedy
BMVC3
1998 A High Performance k-NN Classifier Using a Binary Correlation Matrix Memory
Jim Austin, John Kennedy
NIPS3