Sciweavers

4047 search results - page 116 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
MOBIHOC
2008
ACM
16 years 4 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
JC
2008
128views more  JC 2008»
15 years 4 months ago
Lattice rule algorithms for multivariate approximation in the average case setting
We study multivariate approximation for continuous functions in the average case setting. The space of d variate continuous functions is equipped with the zero mean Gaussian measu...
Frances Y. Kuo, Ian H. Sloan, Henryk Wozniakowski
SODA
2010
ACM
235views Algorithms» more  SODA 2010»
16 years 2 months ago
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
PPL
2006
93views more  PPL 2006»
15 years 4 months ago
Inherently Parallel Geometric Computations
A new computational paradigm is described which o ers the possibility of superlinear and sometimes unbounded speedup, when parallel computation is used. The computations involved ...
Selim G. Akl
ICA
2004
Springer
15 years 10 months ago
Blind Separation of Nonstationary Sources by Spectral Decorrelation
Abstract. This paper demonstrates and exploits some interesting frequency-domain properties of nonstationary signals. Considering these properties, two new methods for blind separa...
Shahram Hosseini, Yannick Deville