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

M. Orlowski

dblp:39/6233 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 1997
—ORCID · none

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

Artificial intelligence and machine learning · 1Theory of computation · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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
Robot manipulation · 100%
Theoretical computer science
1 paper
Computational geometry · 100%

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

TopicWeightPapersLastEvidence papers
Robotics › Robot manipulation
grasping
0.011988
The analysis of equilateral grip of a prismatic and convex workpiece · IEEE J. Robotics Autom. 1988
Robotics › Robot manipulation › grasping
gripper design
0.011988
The analysis of equilateral grip of a prismatic and convex workpiece · IEEE J. Robotics Autom. 1988
Computational geometry
geometric construction
0.011988
The analysis of equilateral grip of a prismatic and convex workpiece · IEEE J. Robotics Autom. 1988
Computational geometry › convex geometry
inscribed polygon
0.011988
The analysis of equilateral grip of a prismatic and convex workpiece · IEEE J. Robotics Autom. 1988

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

computational geometry · 0.0
YearPublicationVenuePosition
1997 Rule extraction from trained artificial neural network with functional dependency preprocessing
abstract
The paper describes a technique to extract symbolic rules from a trained artificial neural network with functional dependency preprocessing. RULEX (R. Andrews and S. Geva, 1994; 1995), classified as a decompositional technique of rule extraction from trained neural network in a recent survey by R. Andrews et al. (1995), is used to extract symbolic rules from data that have been preprocessed by identification of functional dependency. The identification of functional dependency offers several advantages. It can lead to significant reductions in the computational load, to reduction in the number and complexity of derived rules and to the discovery of alternative solutions that would otherwise be ignored by some methods due to implicit or explicit procedural bias. Benchmark datasets from the UCI repository of machine learning databases are used in the testing. Experimental results indicate that by including functional dependency preprocessing performance of RULEX can be improved. Good rule quality is obtained by applying RULEX with functional dependency preprocessing when compared to symbolic rule extraction technique C4.5.
Shlomo Geva, M. T. Wong, M. Orlowski
KES (2)3
1990 A New Algorithm for the Largest Empty Rectangle Problem
M. Orlowski
Algorithmica1
1988 The analysis of equilateral grip of a prismatic and convex workpiece
abstract
Certain facets of the gripping problem in robotics are discussed. A gripper with a single degree of freedom is considered, which consists of three equal-length fingers. The set of workpieces under consideration are modeled by prismatic and convex polyhedra. This leads to a planar-geometric formulation. The computational geometric problem of inscribing, in a given convex polygon, an equilateral triangle that is locally minimal, is addressed. Feasibility and the (computational) geometric construction of the solution are emphasized.>
M. Orlowski, Meir Pachter
IEEE J. Robotics Autom.1