Sciweavers

1289 search results - page 102 / 258
» On the Minimal Embedding Field
Sort
View

Presentation
945views
13 years 12 months ago
A Decentralized Method for Maximizing k-coverage Lifetime in WSNs
In this paper, we propose a decentralized method for maximizing lifetime of data collection wireless sensor networks (WSNs) by making minimal number of nodes operate and putting ot...
DAC
1995
ACM
15 years 9 months ago
On the Bounded-Skew Clock and Steiner Routing Problems
We study the minimum-costbounded-skewrouting tree (BST) problem under the linear delay model. This problem captures several engineering tradeoffs in the design of routing topologi...
Dennis J.-H. Huang, Andrew B. Kahng, Chung-Wen Alb...
EMSOFT
2010
Springer
15 years 4 months ago
Nucleos: a runtime system for ultra-compact wireless sensor nodes
Nucleos is a new runtime system for ultra-lightweight embedded systems. Central to Nucleos is a dispatcher based on the concept of e threaded code, which enables layers of abstrac...
Jiwon Hahn, Pai H. Chou
ICIP
2000
IEEE
16 years 7 months ago
A New Approach to Tracking with Active Contours
This paper addresses the application of active contours or snakes for robust tracking of contours. Conventional snake approaches to tracking initialize the current frame snake wit...
Montse Pardàs, Elisa Sayrol
ISSS
1996
IEEE
125views Hardware» more  ISSS 1996»
15 years 10 months ago
Size-Constrained Code Placement for Cache Miss Rate Reduction
In design of an embedded system with a cache, it is important to minimize the cache miss rate to reduce the power consumption as well as to improvethe performance of the system. W...
Hiroyuki Tomiyama, Hiroto Yasuura