Thomas Fevens

Thomas Fevens

Auto-generated profile, based on publicly available information

Thomas Fevens

Concordia University

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2008 in International Journal of Applied Mathematics and Computer Science
Verified
Journal Article
Open access
PDF file
LJLukasz Jelen
Lukasz Jelen
TFThomas Fevens
Thomas Fevens
AKAdam Krzyzak
Adam Krzyzak
According to the World Health Organization (WHO), breast cancer (BC) is one of the most deadly cancers diagnosed among middle-aged women. Precise diagnosis and prognosis are crucial to reduce the high death rate. In this paper we present a framework for automatic malignancy grading of fine needle aspiration biopsy tissue. The malignancy grade is one of the most important factors taken into consideration during the prediction of cancer behavior after the treatment. Our framework is based on a classification using Support Vector Machines (SVM). The SVMs presented here are able to assign a malignancy grade based on preextracted features with the accuracy up to 94.24%. We also show that SVMs performed best out of four tested classifiers.

1 April 2001 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
TFThomas Fevens
Thomas Fevens
HMHenk Meijer
Henk Meijer
DRDavid Rappaport
David Rappaport


1 November 2016 in Future Generation Computer Systems
Verified
Journal Article
Closed access
AZAbedalmotaleb Zadin
Abedalmotaleb Zadin
TFThomas Fevens
Thomas Fevens

1 January 2006
Verified
Conference Paper
Closed access
AAAlaa Eddien Abdallah
Alaa Eddien Abdallah
TFT. Fevens
T. Fevens
JOJ. Opatrny
J. Opatrny
Position-based routing algorithms use the location information to reduce routing overhead in mobile ad-hoc networks. In this paper we propose two position-based routing algorithms which combine progress-based routing with restricted directional flooding-based routing algorithms for routing in 3 dimensional environments (3D). The first algorithm 3D_ABLAR(m) chooses m neighbors according to a space-partition heuristic and forwards the message to all these nodes. The second algorithm (C, G)-3D_ABLAR(m)-(C, G) uses progress-based routing until a local minimum is reached. The algorithm then switches to the first algorithm for one step and then progress-based routing is resumed. We evaluate our algorithm and compare it with current routing algorithms. The simulation results show a significant improvement in delivery rate (99% compared to 63%) and reduction in traffic (up to 50%)

10 May 2024 in International Journal of Computer Assisted Radiology and Surgery
Verified
Journal Article
Closed access
PDF file
ABAthanasios Babouras
Athanasios Babouras
PAPatrik Abdelnour
Patrik Abdelnour
TFThomas Fevens
Thomas Fevens
PMPaul A. Martineau
Paul A. Martineau