Sciweavers

370 search results - page 38 / 74
» Improved Approximation Algorithms for Connected Sensor Cover
Sort
View
COMCOM
2006
147views more  COMCOM 2006»
14 years 11 months ago
Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks
Due to the application-specific nature of wireless sensor networks, application-aware algorithm and protocol design paradigms are highly required in order to optimize the overall ...
Wook Choi, Sajal K. Das
DAC
2009
ACM
16 years 20 days ago
Provably good and practically efficient algorithms for CMP dummy fill
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
Chunyang Feng, Hai Zhou, Changhao Yan, Jun Tao, Xu...
INFOCOM
2009
IEEE
15 years 6 months ago
Sensor Network Localization Using Sensor Perturbation
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...
Yuanchen Zhu, Steven J. Gortler, Dylan Thurston
IJSNET
2006
92views more  IJSNET 2006»
14 years 11 months ago
TTS: a two-tiered scheduling mechanism for energy conservation in wireless sensor networks
: In this paper, we present a two-tiered scheduling approach for effective energy conservation in wireless sensor networks. The effectiveness of this mechanism relies on dynamicall...
Nurcan Tezcan, Wenye Wang
IFIP12
2007
15 years 1 months ago
Clustering Improves the Exploration of Graph Mining Results
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
Edgar H. de Graaf, Joost N. Kok, Walter A. Kosters