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

Paul A. Rubin

dblp:58/4050 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
1since 2021 · last 2022
0000-0002-6313-4968ORCID · verified

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

Artificial intelligence and machine learning · 1Computer networks · 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
Representation and self-supervised learning · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
feature selection
0.012003
Feature Selection for Multiclass Discrimination via Mixed-Integer Linear Programming · IEEE Trans. Pattern Anal. Mach. Intell. 2003
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction › feature selection
multi-class feature selection
0.012003
Feature Selection for Multiclass Discrimination via Mixed-Integer Linear Programming · IEEE Trans. Pattern Anal. Mach. Intell. 2003
Mathematical optimization › discrete optimization
mixed integer linear programming
0.012003
Feature Selection for Multiclass Discrimination via Mixed-Integer Linear Programming · IEEE Trans. Pattern Anal. Mach. Intell. 2003

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

branch-and-bound · 0.1mixed-integer linear programming · 0.0mixed integer linear programming · 0.0
YearPublicationVenuePosition
2022 HERRA: Energy-Aware Scalable D2D 5G Cellular Traffic Offloading Scheme
abstract
Data offloading based on Device-to-Device (D2D) can support congestion-prone cellular networks in the face of traffic growth. In this paper, we tackle the design of offloading systems that are aware of the energy limitation of the complementary D2D network. We propose a novel heuristic scheme, named HERRA, using a parametric three-stage method that includes possible variations on the employed strategies in each stage. Performance evaluation, using network simulations in our extended NS-3, shows that HERRA outperforms the related work in the matter of convergence time. As a result of massive speedups, up to six orders of magnitude, HERRA scales very well in denser topologies at the price of having some performance gaps, particularly in terms of packet loss.
Safwan Alwan, Ilhem Fajjari, Nadjib Aitsaadi, Paul A. Rubin
NOMS4
2016 A novel 3D underwater WSN deployment strategy for full-coverage and connectivity in rivers
abstract
In this paper, we propose a novel 3D Underwater Wireless Sensor Network Deployment scheme for solid detection in rivers. Our objective is to minimize the number of deployed underwater sensors within a target field installation while ensuring i) the required Quality of Monitoring (QoM) (i.e., differentiated probabilistic detection) and ii) wireless network connectivity. To generate the best topology, we propose a novel deployment heuristic, named 3D-UWSN-Deploy, based on a subcube tessellation of the monitored field installation and a mixed integer linear program optimization. To gauge the effectiveness of 3D-UWSN-Deploy, we compare it with the most prominent related strategies. Simulation results show that our proposal is scalable and obtains the best performance in terms of cost deployment, quality of monitoring and connectivity.
Zakia Khalfallah, Ilhem Fajjari, Nadjib Aitsaadi, Paul A. Rubin, Guy Pujolle
ICC4
2003 Feature Selection for Multiclass Discrimination via Mixed-Integer Linear Programming
abstract
We reformulate branch-and-bound feature selection employing L/sub /spl infin// or particular L/sub p/ metrics, as mixed-integer linear programming (MILP) problems, affording convenience of widely available MILP solvers. These formulations offer direct influence over individual pairwise interclass margins, which is useful for feature selection in multiclass settings.
Frank J. Iannarilli Jr., Paul A. Rubin
IEEE Trans. Pattern Anal. Mach. Intell.2