831 search results - page 9 / 167 » Finding Minimum Data Requirements Using Pseudo-independence |
ICANNGA
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In wireless sensor networks where sensors are geographically deployed in 3D spaces, a mobile robot is required to travel to each sensor in order to download the data. The...
ECCV
2010
Springer
15 years 2 months ago
2010
Springer
Many segmentation algorithms describe images in terms of a hierarchy of regions. Although such hierarchies can produce state of the art segmentations and have many applications, th...
STOC
1996
ACM
15 years 1 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
80
Voted
IOLTS
2008
IEEE
15 years 3 months ago
2008
IEEE
In this paper, we propose a new SystemC-based fault injection technique that has improved fault representation in visible and on-the-fly data and signal registers. The technique ...
IPPS
1996
IEEE
15 years 1 months ago
1996
IEEE
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...