Sciweavers

1368 search results - page 257 / 274
» Signal Probability Based Statistical Timing Analysis
Sort
View
DCOSS
2006
Springer
13 years 11 months ago
Lifetime Maximization of Sensor Networks Under Connectivity and k-Coverage Constraints
In this paper, we study the fundamental limits of a wireless sensor network's lifetime under connectivity and k-coverage constraints. We consider a wireless sensor network wit...
Wei Mo, Daji Qiao, Zhengdao Wang
ATAL
2008
Springer
13 years 9 months ago
Complexity of terminating preference elicitation
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
Toby Walsh
ICA
2004
Springer
14 years 1 months ago
Postnonlinear Overcomplete Blind Source Separation Using Sparse Sources
Abstract. We present an approach for blindly decomposing an observed random vector x into f(As) where f is a diagonal function i.e. f = f1 × . . . × fm with one-dimensional funct...
Fabian J. Theis, Shun-ichi Amari
SAC
2006
ACM
13 years 7 months ago
Combining supervised and unsupervised monitoring for fault detection in distributed computing systems
Fast and accurate fault detection is becoming an essential component of management software for mission critical systems. A good fault detector makes possible to initiate repair a...
Haifeng Chen, Guofei Jiang, Cristian Ungureanu, Ke...
ICC
2007
IEEE
203views Communications» more  ICC 2007»
14 years 2 months ago
Distributed Cooperative Routing for UWB Ad-Hoc Networks
— Ultra wide band (UWB) ad-hoc networks have attracted much research attention in recent years. This paper proposes and investigates a new distributed cooperative routing strateg...
Shouhong Zhu, Kin K. Leung