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

Itay Meiri

dblp:59/1271 · DBLP profile ↗
← Back
9ranked-venue papers
5as first author
1since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 9 · 5 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

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
7 papers
Knowledge representation and reasoning · 51% Planning, search and constraint satisfaction · 49%
Theoretical computer science
3 papers
Graph algorithms and graph theory · 57% Computational complexity · 43%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning
temporal reasoning
0.041996
Combining Qualitative and Quantitative Constraints in Temporal Reasoning · Artif. Intell. 1996
Temporal Constraint Networks · Artif. Intell. 1991
Combining Qualitative and Quantitative Constraints in Temporal Reasoning · AAAI 1991
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › constraint programming
constraint networks
0.021996
Uncovering Trees in Constraint Networks · Artif. Intell. 1996
Temporal Constraint Networks · Artif. Intell. 1991
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
temporal network
0.021991
Temporal Constraint Networks · Artif. Intell. 1991
Temporal Constraint Networks · KR 1989
Graph algorithms and graph theory › graph decomposition
tree decomposition
0.021996
Tree Decomposition with Applications to Constraint Processing · AAAI 1990
Uncovering Trees in Constraint Networks · Artif. Intell. 1996
Computational complexity
constraint satisfaction
0.021990
Tree Decomposition with Applications to Constraint Processing · AAAI 1990
Temporal Constraint Networks · KR 1989
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
constraint propagation
0.011994
Experimental Evaluation of Preprocessing Algorithms for Constraint Satisfaction Problems · Artif. Intell. 1994

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

preprocessing algorithm · 0.0experimental evaluation · 0.0temporal reasoning · 0.0constraint reasoning · 0.0constraint propagation · 0.0graph algorithms · 0.0
YearPublicationVenuePosition
2025 Out-Of-Distribution Is Not Magic: The Clash Between Rejection Rate and Model Success
abstract
Recent advancements in Internet protocols, including DNS over HTTPS (DoH) and Encrypted Service Name Indicators (ESNI), are making traditional Deep Packet Inspection (DPI) engines obsolete.Consequently, there is a growing need for nextgeneration traffic classification using artificial intelligence (AI).While DPI automatically categorizes unknown traffic as 'other,' AI-based models cannot automatically handle unknown or Outof-Distribution (OOD) traffic.AI models must effectively detect and classify OOD traffic to ensure robustness, reliability, and accuracy in real-world applications; however, current research often fails to address the challenges of OOD detection.In this paper, we evaluate various state-of-the-art OOD detection techniques for internet traffic classification and explore the drawbacks and advantages of using different threshold levels for the model's tolerance for OOD.Our findings reveal that varying rejection rates have distinct effects on OOD techniques, leading to a change in the optimal strategy for achieving dependable and precise detection across diverse OOD scenarios.We demonstrate that adjusting rejection rates from 10% to 30% can significantly improve the True Detection Rate (TDR) by up to 50%, while the False Detection Rate (FDR) may increase by less than 10%.Moreover, we emphasize that rejection-rate-based evaluation is pivotal for next-generation flow classification, promising a substantial reduction in FDR through rigorous methodological assessment.
Itay Meiri, Ran Dubin, Amit Dvir, Chen Hajaj
FedCSIS1
1996 Combining Qualitative and Quantitative Constraints in Temporal Reasoning
Itay Meiri
Artif. Intell.1
1996 Uncovering Trees in Constraint Networks
Itay Meiri, Rina Dechter, Judea Pearl
Artif. Intell.1
1994 Experimental Evaluation of Preprocessing Algorithms for Constraint Satisfaction Problems
Rina Dechter, Itay Meiri
Artif. Intell.2
1991 Combining Qualitative and Quantitative Constraints in Temporal Reasoning
Itay Meiri
AAAI1
1991 Temporal Constraint Networks
Rina Dechter, Itay Meiri, Judea Pearl
Artif. Intell.2
1990 Tree Decomposition with Applications to Constraint Processing
Itay Meiri, Judea Pearl, Rina Dechter
AAAI1
1989 Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems
Rina Dechter, Itay Meiri
IJCAI2
1989 Temporal Constraint Networks
Rina Dechter, Itay Meiri, Judea Pearl
KR2