Sciweavers

909 search results - page 70 / 182
» On the approximability of some network design problems
Sort
View
JAT
2010
109views more  JAT 2010»
15 years 4 months ago
Networks of polynomial pieces with application to the analysis of point clouds and images
We consider H¨older smoothness classes of surfaces for which we construct piecewise polynomial approximation networks, which are graphs with polynomial pieces as nodes and edges ...
Ery Arias-Castro, Boris Efros, Ofer Levi
DCOSS
2011
Springer
14 years 6 months ago
On sensor selection in linked information networks
—Sensor networks are often redundant by design; this is often done in order to achieve reliability in information processing. In many cases, the redundancy relationships between ...
Charu C. Aggarwal, Amotz Bar-Noy, Simon Shamoun
ICPPW
2002
IEEE
15 years 11 months ago
Finding Multiple Routing Paths in Wide-Area WDM Networks
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpat...
Weifa Liang, Xiaojun Shen
GLOBECOM
2009
IEEE
15 years 10 months ago
Optimization of Energy Efficient Transmission in Underwater Sensor Networks
Underwater communication is a challenging topic due to its singular channel characteristics. Most protocols used in terrestrial wireless communication can not be directly applied i...
Hongkun Yang, Bin Liu, Fengyuan Ren, Hao Wen, Chua...
GECCO
2007
Springer
558views Optimization» more  GECCO 2007»
16 years 11 days ago
A chain-model genetic algorithm for Bayesian network structure learning
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
Ratiba Kabli, Frank Herrmann, John McCall