In 1989, an effort to solve the game of checkers began. It was naïve because of the daunting size of the search space, 5×1020 positions, and because of computer capabilities of ...
We give an O(n2 m + nm2 + m2 log m) time and O(n2 + m2 ) space algorithm for finding the shortest traveling salesman tour through the vertices of two simple polygonal obstacles i...
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
Eamonn J. Keogh, Kaushik Chakrabarti, Sharad Mehro...
Effective mechanisms for detecting and thwarting Distributed Denial-of-Service (DDoS) attacks are becoming increasingly important to the success of today’s Internet as a viable ...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
Recent advancements in sensor technology have made it possible to collect enormous amounts of data in real time. However, because of the sheer volume of data most of it will never...
Li Wei, Nitin Kumar, Venkata Nishanth Lolla, Eamon...