Many recent successful planners use domain-independent heuristics to speed up the search for a valid plan. An orthogonal approach to accelerating search is to identify and remove r...
An efficient low-cost, low-power hardware implementation of a novel run-time pixel coverage mask generation algorithm for embedded 3-D graphics antialiasing purposes is presented....
Dan Crisu, Sorin Cotofana, Stamatis Vassiliadis, P...
We consider the problem of finding the best match for a given query shape among candidate shapes stored in a shape base. This is central to a wide range of applications, such as, d...
This paper presents an energy-aware, sleep scheduling algorithm called SSMTT to support multiple target tracking sensor networks. SSMTT leverages the awakening result of interferi...
Abstract. Sometimes there is a need to store sensitive data on an untrusted database server. Song, Wagner and Perrig have introduced a way to search for the existence of a word in ...
Richard Brinkman, Ling Feng, Jeroen Doumen, Pieter...