ibe an abstract data model of protein structures by representing the geometry of proteins using spatial data types and present a framework for fast structural similarity search bas...
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Information visualization shows tremendous potential for helping both expert and casual users alike make sense of temporal data, but current time series visualization tools provid...
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kern...
Background: An alternative to standard approaches to uncover biologically meaningful structures in micro array data is to treat the data as a blind source separation (BSS) problem...
Attila Frigyesi, Srinivas Veerla, David Lindgren, ...