298 search results - page 18 / 60 » Minimizing Flow Time in the Wireless Gathering Problem |
ECCV
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
The maximum flow algorithm for minimizing energy functions of binary variables has become a standard tool in computer vision. In many cases, unary costs of the energy depend linea...
ITC
2003
IEEE
14 years 18 days ago
2003
IEEE
This paper discusses the adoption of Embedded Deterministic Test (EDT) at Infineon Technologies as a means to reduce the cost of manufacturing test without compromising test quali...
PIMRC
2008
IEEE
14 years 1 months ago
2008
IEEE
—In wireless sensor networks, in-network aggregation is the process of compressing locally the data gathered by the sensor nodes, so that only the compressed data travel across s...
SUTC
2006
IEEE
2006
IEEE
Schedules with Minimized Access Latency for Disseminating Dependent Information on Multiple Channels
14 years 1 months ago
In wireless mobile environments, data broadcasting is an effective approach to disseminate information to mobile clients. In some applications, the access pattern of all the data...