Sciweavers

11565 search results - page 228 / 2313
» Computing Minimal Mappings
Sort
View
INFOCOM
2007
IEEE
16 years 29 days ago
Low-Complexity and Distributed Energy Minimization in Multi-Hop Wireless Networks
— In this work, we study the problem of minimizing the total power consumption in a multi-hop wireless network subject to a given offered load. It is well-known that the total po...
Longbi Lin, Xiaojun Lin, Ness B. Shroff
RTSS
2007
IEEE
16 years 28 days ago
Distributed Minimal Time Convergecast Scheduling for Small or Sparse Data Sources
— Many applications of sensor networks require the base station to collect all the data generated by sensor nodes. As a consequence many-to-one communication pattern, referred to...
Ying Zhang, Shashidhar Gandham, Qingfeng Huang
MMSEC
2006
ACM
148views Multimedia» more  MMSEC 2006»
16 years 18 days ago
Minimizing the embedding impact in steganography
In this paper, we study the trade-off in steganography between the number of embedding changes and their amplitude. We assume that each element of the cover image is assigned a sc...
Jessica J. Fridrich
PVM
2004
Springer
16 years 8 hour ago
Minimizing Synchronization Overhead in the Implementation of MPI One-Sided Communication
The one-sided communication operations in MPI are intended to provide the convenience of directly accessing remote memory and the potential for higher performance than regular poin...
Rajeev Thakur, William D. Gropp, Brian R. Toonen
SCALESPACE
2009
Springer
15 years 11 months ago
From a Single Point to a Surface Patch by Growing Minimal Paths
Abstract. We introduce a novel implicit approach for surface patch segmentation in 3D images starting from a single point. Since the boundary surface of an object is locally homeom...
Fethallah Benmansour, Laurent D. Cohen