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

Idil Zeynep Alemdar

dblp:207/7897 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2021
—ORCID · none

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

Artificial intelligence and machine learning · 1Systems, architecture and hardware · 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.

Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 67% Robot navigation and mapping · 33%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning
boltzmann machine
0.312018
What is (Missing or Wrong) in the Scene? A Hybrid Deep Boltzmann Machine for Contextualized Scene Modeling · ICRA 2018
Machine learning › Probabilistic and Bayesian machine learning › structured models
graphical models
0.312018
What is (Missing or Wrong) in the Scene? A Hybrid Deep Boltzmann Machine for Contextualized Scene Modeling · ICRA 2018
Robotics › Robot navigation and mapping › environment representation
scene modeling
0.312018
What is (Missing or Wrong) in the Scene? A Hybrid Deep Boltzmann Machine for Contextualized Scene Modeling · ICRA 2018

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

tri-way edges · 0.3hybrid boltzmann machine · 0.3
YearPublicationVenuePosition
2021 Max-Min Fair Bandwidth Allocation in Millimeter-Wave Radio Clusters
abstract
Enabling ultra high speed wireless communication, Extreme High Frequency (EHF) or Millimeter Wave (mmWave) bands will play a significant role for the 5G. Apart from speed, 5G will be very useful for handling great amounts of data simultaneously and serving bandwidth hungry applications as well. Ultra high quality and ultra fast video streaming will be one of those applications that will be made possible by 5G. While serving bandwidth hungry applications with ease will be an important development and maximizing throughput is most of the time the main goal in a network, it is also important to make sure that no other application starves. In order to prevent such a situation, fair bandwidth allocation should be considered in wireless communications. We simulated a max-min fair bandwidth allocation scenario in a mmWave radio cluster, where a radio cluster is a set of base stations connected to a main hub over 60 GHz radio links. We ran experiments with different path loss exponent values with increasing number of base stations to examine the effects of topology complexity and radio signal loss on the optimization time and on the overall network throughput while maintaining max-min fair allocation. The results showed that as the topology becomes more complex, the problem takes longer to solve. However, the overall network throughput increases. In addition, our model has achieved a decent quantitative fairness level as shown by Jain's index values, which are always more than 0.5 on a scale of 0 to 1 with respect to the topology complexity and the number users.
Idil Zeynep Alemdar, Ertan Onur
CNSM1
2018 What is (Missing or Wrong) in the Scene? A Hybrid Deep Boltzmann Machine for Contextualized Scene Modeling
abstract
Scene models allow robots to reason about what is in the scene, what else should be in it, and what should not be in it. In this paper, we propose a hybrid Boltzmann Machine (BM) for scene modeling where relations between objects are integrated. To be able to do that, we extend BM to include tri-way edges between visible (object) nodes and make the network to share the relations across different objects. We evaluate our method against several baseline models (Deep Boltzmann Machines, and Restricted Boltzmann Machines) on a scene classification dataset, and show that it performs better in several scene reasoning tasks.
Ilker Bozcan, Yagmur Oymak, Idil Zeynep Alemdar, Sinan Kalkan
ICRA3