Many data mining tasks (e.g., Association Rules, Sequential Patterns) use complex pointer-based data structures (e.g., hash trees) that typically suffer from sub-optimal data loca...
Srinivasan Parthasarathy, Mohammed Javeed Zaki, We...
We studied a number of measures that characterize the difficulty of a classification problem. We compared a set of real world problems to random combinations of points in this mea...
This study concerns the development of 3D interfaces that aid the navigation of large data structures through the usage of the HSV color space, and the ensuing “spatial frames...
Elif E. Ayiter, Selim Balcisoy, Murat Germen, Isma...
— Many methods exist for the automatic and optimal 3D reconstruction of camera motion and scene structure from image sequence (’Structure from Motion‘ or SfM). The solution t...
We consider delay management in railway systems. Given delayed trains, we want to find a waiting policy for the connecting trains minimizing the weighted total passenger delay. If...