Jay Rajasekera

According to our database, Jay Rajasekera authored at least 11 papers between 1986 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Efficient Online Engagement Analytics Algorithm Toolkit That Can Run on Edge.

Saw Thiha, Jay Rajasekera

Algorithms, February, 2023

2022

An Emotion and Attention Recognition System to Classify the Level of Engagement to a Video Conversation by Participants in Real Time Using Machine Learning Models and Utilizing a Neural Accelerator Chip.

Janith Kodithuwakku, Dilki Dandeniya Arachchi, Jay Rajasekera

Algorithms, 2022

2010

Using Kansei Engineering with new JIT to accomplish cost advantage.

Jay Rajasekera, Shantanu Dayal

Int. J. Biom., 2010

2002

An Important Issue in Data Mining : Data Cleaning.

Qi Xiao Yang, Sam Yuan Sung, Chun Lu, Jay Rajasekera

Proceedings of the 16th Pacific Asia Conference on Language, Information and Computation, 2002

2001

Estimating the Firm Value Distribution Function by Entropy Optimization and Geometric Programming.

J. R. Rajasekera, M. Yamada

Ann. Oper. Res., 2001

1995

Entropy Optimization Models with Convex Constraints

Shu-Cherng Fang, J. R. Rajasekera

Inf. Comput., February, 1995

1991

On the convex programming approach to linear programming.

J. R. Rajasekera, Shu-Cherng Fang

Oper. Res. Lett., 1991

1989

Quadratically constrained minimum cross-entropy analysis.

Shu-Cherng Fang, J. R. Rajasekera

Math. Program., 1989

1987

A perturbation approach to the main duality theorem of quadratic geometric programming.

Shu-Cherng Fang, Jay Rajasekera

Z. Oper. Research, 1987

1986

Controlled perturbations for quadratically constrained quadratic programs.

Shu-Cherng Fang, J. R. Rajasekera

Math. Program., 1986

Controlled dual perturbations for l_<i>p</i>-programming.

Shu-Cherng Fang, Jay Rajasekera

Z. Oper. Research, 1986