5624 search results - page 794 / 1125 » On Conditional Covering Problem |
143
click to vote
MOBIHOC
2001
ACM
16 years 4 months ago
2001
ACM
The development of practical, localized algorithms is probably the most needed and most challenging task in wireless ad-hoc sensor networks (WASNs). Localized algorithms are a spe...
135
click to vote
MOBIHOC
2004
ACM
16 years 4 months ago
2004
ACM
Smart antennas represent a broad variety of antennas that differ in their performance and transceiver complexity. The superior capabilities of smart antennas, however, can be leve...
127
click to vote
ICCAD
2004
IEEE
16 years 1 months ago
2004
IEEE
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we model each task ...
128
click to vote
ICCAD
2003
IEEE
16 years 1 months ago
2003
IEEE
In this paper, we study the problem of retiming of sequential circuits with both interconnect and gate delay. Most retiming algorithms have assumed ideal conditions for the non-lo...
116
click to vote
CVPR
2010
IEEE
16 years 20 days ago
2010
IEEE
This paper addresses the problem of recognizing shadows from monochromatic natural images. Without chromatic information, shadow classification is very challenging because the in...