Due to the wide range of services being supported, telecommunications networks are loaded with massive quantities of information. This stimulates extra concern for network surviva...
This paper studies a number of hash-based join algorithms for general purpose multiprocessor computers with shared memory where the amount of memory allocated to the join operatio...
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3list-coloring. Our algorithms are based on a constraint satisfaction...
At Eurocrypt 2010, Howgrave-Graham and Joux described an algorithm for solving hard knapsacks of density close to 1 in time ˜O(20.337n ) and memory ˜O(20.256n ), thereby improvin...
Object detection and tracking has various application areas including intelligent transportation systems. We introduce an object detection and tracking approach that combines the ...