71 search results - page 3 / 15 » On the Complexity of Reliable Root Approximation |
STACS
2001
Springer
14 years 2 days ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
ECCV
2010
Springer
13 years 8 months ago
2010
Springer
Although the recent advances in the sparse representations of images have achieved outstanding denosing results, removing real, structured noise in digital videos remains a challen...
RC
2002
13 years 7 months ago
2002
An exact parameterization for the boundary of the Minkowski product of N circular disks in the complex plane is derived. When N > 2, this boundary curve may be regarded as a gen...
SIGMETRICS
2010
ACM
13 years 7 months ago
2010
ACM
Abstract Due to complexity and intractability reasons, most of the analytical studies on the reliability of communication paths in mobile ad hoc networks are based on the assumptio...
IPSN
2009
Springer
14 years 2 months ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...