We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
In a wireless sensor network of N nodes transmitting data to a single base station, possibly over multiple hops, what distributed mechanisms should be implemented in order to dyna...
Direct implementations of bilateral filtering show O(r2 ) computational complexity per pixel, where r is the filter window radius. Several lower complexity methods have been devel...
Wei Yu, Franz Franchetti, James C. Hoe, Yao-Jen Ch...
This paper introduces a new optimization technique called hyperplane annealing. It is similar to the mean field annealing approach to combinatorial optimization. Both annealing te...
Abstract— In this paper, we propose an ontology specification for JavaBean programs, the object component model of Java. Our specification is written using the DAML+OIL languag...