Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
Edgar H. de Graaf, Joost N. Kok, Walter A. Kosters
The huge amount of the available information in the Web creates the need of effective information extraction systems that are able to produce metadata that satisfy user's inf...
A novel approach to measure the interdependence of two time series is proposed, referred to as “stochastic event synchrony” (SES); it quantifies the alignment of two point pr...
We consider the problem of query containment over an object data model derived from F-logic. F-logic has generated considerable interest commercially, in the academia, and within ...
Developing Web applications is usually accomplished in ad hoc manner. Such manner generally results in very poor quality products, with "spaghetti-like" structures makin...
Mohamed Sharaf Aun, I. M. Atiqul, Shoji Yuen, Kiyo...