activity
20082024
most citedObservability Properties of Colored Graphs

6 citations · 20 across the 7 of their papers we have counts for

collaborators

7 papers

cs.AI2024

TEL'M: Test and Evaluation of Language Models

George Cybenko, Joshua Ackerman, Paul Lintilhac

Language Models have demonstrated remarkable capabilities on some tasks while failing dramatically on others. The situation has generated considerable interest in understanding and…

cs.CL2020★ 5 cited

A Survey of Neural Networks and Formal Languages

Joshua Ackerman, George Cybenko

This report is a survey of the relationships between various state-of-the-art neural network architectures and formal languages as, for example, structured by the Chomsky Language…

cs.LG2020

Analytic Properties of Trackable Weak Models

Mark Chilenski, George Cybenko, Isaac Dekine +2

We present several new results on the feasibility of inferring the hidden states in strongly-connected trackable weak models. Here, a weak model is a directed graph in which each n…

cs.LG2018★ 6 cited

Observability Properties of Colored Graphs

Mark Chilenski, George Cybenko, Isaac Dekine +2

A colored graph is a directed graph in which nodes or edges have been assigned colors that are not necessarily unique. Observability problems in such graphs consider whether an age…

cs.CR2018★ 4 cited

Control Flow Graph Modifications for Improved RF-Based Processor Tracking Performance

Mark Chilenski, George Cybenko, Isaac Dekine +2

Many dedicated embedded processors do not have memory or computational resources to coexist with traditional (host-based) security solutions. As a result, there is interest in usin…

cs.LG2011★ 2 cited

Attacking and Defending Covert Channels and Behavioral Models

Valentino Crespi, George Cybenko, Annarita Giani

In this paper we present methods for attacking and defending -gram statistical analysis techniques that are used, for example, in network traffic analysis and covert channel det…

cs.LG2008★ 3 cited

Learning Hidden Markov Models using Non-Negative Matrix Factorization

George Cybenko, Valentino Crespi

The Baum-Welsh algorithm together with its derivatives and variations has been the main technique for learning Hidden Markov Models (HMM) from observational data. We present an HMM…