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

Plamen Hristov

dblp:25/5358 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
1since 2021 · last 2021
—ORCID · unresolved

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

Theory of computation · 2

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.

Theoretical computer science
2 papers
Coding theory · 100%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
coding bounds
0.122003
New binary one-generator quasi-cyclic codes · IEEE Trans. Inf. Theory 2003
New quasi-twisted degenerate ternary linear codes · IEEE Trans. Inf. Theory 2003
Coding theory › error-correcting codes › block codes
linear code
0.122003
New binary one-generator quasi-cyclic codes · IEEE Trans. Inf. Theory 2003
New quasi-twisted degenerate ternary linear codes · IEEE Trans. Inf. Theory 2003
Coding theory › error-correcting codes › coding bounds
minimum distance bounds
0.122003
New binary one-generator quasi-cyclic codes · IEEE Trans. Inf. Theory 2003
New quasi-twisted degenerate ternary linear codes · IEEE Trans. Inf. Theory 2003
Coding theory › error-correcting codes › block codes › linear code › quasi-cyclic codes
1-generator quasi-cyclic code
0.012003
New binary one-generator quasi-cyclic codes · IEEE Trans. Inf. Theory 2003
Coding theory › error-correcting codes › block codes › linear code
quasi-cyclic codes
0.012003
New binary one-generator quasi-cyclic codes · IEEE Trans. Inf. Theory 2003
Coding theory › error-correcting codes › block codes › linear code
quasi-twisted codes
0.012003
New quasi-twisted degenerate ternary linear codes · IEEE Trans. Inf. Theory 2003
Coding theory › error-correcting codes › block codes › linear code › nonbinary linear codes
ternary linear codes
0.012003
New quasi-twisted degenerate ternary linear codes · IEEE Trans. Inf. Theory 2003
Coding theory › error-correcting codes
code construction
0.022003
New binary one-generator quasi-cyclic codes · IEEE Trans. Inf. Theory 2003
New quasi-twisted degenerate ternary linear codes · IEEE Trans. Inf. Theory 2003

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

quasi-twisted construction · 0.0quasi-cyclic construction · 0.0
YearPublicationVenuePosition
2021 Human-Object Interaction Detection: 1D Convolutional Neural Network Approach Using Skeleton Data
abstract
Human-object interaction detection is a somewhat recently emerged scientific topic, which is mainly due to the advent of deep learning algorithms. Most current methods are performed on single images, detecting separately humans and objects, using state-of-the-art pose detection and object detection networks. The networks ease the overall task by allowing for learning of the readily inferred features. When adding the time dimension into the equation, this task becomes more complex, as temporal features between frames have to be taken into account. The paper aims to show an approach for detecting human interactions in videos, which utilizes several different methods - YOLOv5 for object detection, CSR-DCF and Kalman Filter for object tracking, and ID Convolutional Neural Network (1D-CNN) for real-time interaction detection. The overall algorithm is purposed for salient and rigid (modern-solid) objects in mind, positioned in closed-door scenes. The dataset and task are privately defined, that is they are relevant to this work only and cannot be compared to other works. The overall algorithm is tested on a subset of the PKU Multi-Modality Dataset (PKUMMD).
Plamen Hristov, Dimiter R. Avresky, Ognian Boumbarov
NCA1
2003 New quasi-twisted degenerate ternary linear codes
abstract
Twenty six ternary linear quasi-twisted codes improving the best known lower bounds on minimum distance are constructed.
Rumen N. Daskalov, Plamen Hristov
IEEE Trans. Inf. Theory2
2003 New binary one-generator quasi-cyclic codes
abstract
Sixteen new binary quasi-cyclic linear codes improving the best known lower bounds on minimum distance in Brouwer's tables are constructed. The parameters of these codes are [102, 26, 32], [102, 27, 30], [142, 35, 40], [142, 36, 38] [146, 36, 40], [170, 16, 72], [170, 20, 66], [170, 33, 52] [170, 36, 50], [178, 33, 56], [178, 34, 54], [182, 27, 64] [182, 36, 56], [186, 17, 76], [210, 23, 80], [254, 22, 102] Sixty cyclic and thirty quasi-cyclic codes, which attain the respective bounds in Brouwer's table and are not included in Chen's table are presented as well.
Rumen N. Daskalov, Plamen Hristov
IEEE Trans. Inf. Theory2