2621 search results - page 156 / 525 » Near orders and codes |
167
click to vote
GLOBECOM
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper, we investigate the maximization of the amount of gathered data in a clustered wireless sensor network (WSN). The amount of gathered data is maximized by (1) choosing...
186
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
Given a directed graph G = (V, E) and an integer k ≥ 1, a Steiner k-transitive-closure-spanner (Steiner k-TC-spanner) of G is a directed graph H = (VH , EH ) such that (1) V ⊆ ...
177
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
With nearly one billion online videos viewed everyday, an emerging new frontier in computer vision research is recognition and search in video. While much effort has been devoted ...
212
click to vote
CAV
2009
Springer
16 years 7 months ago
2009
Springer
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
124
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
We present a novel selective blurring algorithm that mimics the optical distance blur effects that occur naturally in cameras and eyes. The proposed algorithm provides a realistic...