6105 search results - page 961 / 1221 » A Parallel Algorithm for Bound-Smoothing |
197
click to vote
TPDS
2008
15 years 6 months ago
2008
It has been discussed in the literature that the mobility of a mobile sensor network (MSN) can be used to improve its sensing coverage. How the mobility can efficiently be managed ...
164
click to vote
TSP
2008
15 years 6 months ago
2008
Abstract--This paper presents a new approach to soft demodulation for MIMO channels. The proposed method is an approximation to the exact a posteriori probability-per-bit computer....
162
click to vote
MAM
2007
15 years 6 months ago
2007
Cellular computing architectures represent an important class of computation that are characterized by simple processing elements, local interconnect and massive parallelism. Thes...
250
click to vote
CVGIP
2004
15 years 6 months ago
2004
In this paper we present an efficient method for interpolating a piecewise-linear surface between two parallel slices, each consisting of an arbitrary number of (possibly nested) ...
188
click to vote
CLUSTER
2002
IEEE
15 years 6 months ago
2002
IEEE
Abstract. We describe and evaluate the Running Time Advisor (RTA), a system that can predict the running time of a compute-bound task on a typical shared, unreserved commodity host...