Sciweavers

465 search results - page 42 / 93
» On the Hardness of Range Assignment Problems
Sort
View
CGF
2010
157views more  CGF 2010»
14 years 12 months ago
Binary Shading Using Appearance and Geometry
In the style of binary shading, shape and illumination are depicted using two colors, typically black and white, that form coherent lines and regions in the image. We formulate th...
Bert Buchholz, Tamy Boubekeur, Doug DeCarlo, Marc ...
WINET
2010
128views more  WINET 2010»
14 years 10 months ago
Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
Harri Haanpää, André Schumacher, ...
EWSN
2008
Springer
15 years 11 months ago
Lifetime Maximization in Wireless Sensor Networks by Distributed Binary Search
We consider the problem of determining the transmission power assignment that maximizes the lifetime of a data-gathering wireless sensor network with stationary nodes and static tr...
André Schumacher, Harri Haanpää, ...
GFKL
2005
Springer
141views Data Mining» more  GFKL 2005»
15 years 5 months ago
On External Indices for Mixtures: Validating Mixtures of Genes
Mixture models represent results of gene expression cluster analysis in a more natural way than ’hard’ partitions. This is also true for the representation of gene labels, such...
Ivan G. Costa, Alexander Schliep
IJSNET
2007
95views more  IJSNET 2007»
14 years 11 months ago
On extracting consistent graphs in wireless sensor networks
: Robustness and security of services like localisation, routing and time synchronisation in Wireless Sensor Networks (WSNs) have been critical issues. Efficient mathematical (gra...
Murtuza Jadliwala, Qi Duan, Jinhui Xu, Shambhu J. ...