Sciweavers

4047 search results - page 383 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
FSEN
2009
Springer
16 years 1 months ago
The Complexity of Reachability in Randomized Sabotage Games
Abstract. We analyze a model of fault-tolerant systems in a probabilistic setting. The model has been introduced under the name of “sabotage games”. A reachability problem over...
Dominik Klein, Frank G. Radmacher, Wolfgang Thomas
TAMC
2009
Springer
16 years 1 months ago
On Parameterized Exponential Time Complexity
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
Jianer Chen, Iyad A. Kanj, Ge Xia
ALGOSENSORS
2008
Springer
15 years 8 months ago
Target Counting under Minimal Sensing: Complexity and Approximations
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
Sorabh Gandhi, Rajesh Kumar 0003, Subhash Suri
SCIA
2005
Springer
186views Image Analysis» more  SCIA 2005»
16 years 4 days ago
Levelset and B-Spline Deformable Model Techniques for Image Segmentation: A Pragmatic Comparative Study
Deformable contours are now widely used in image segmentation, using different models, criteria and numeric schemes. Some theoretical comparisons between few deformable model met...
Diane Lingrand, Johan Montagnat
SECON
2010
IEEE
15 years 4 months ago
Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks: Efficient Approximations
In a wireless sensor network, short range multihop transmissions are preferred to prolong the network lifetime due to super-linear nature of energy consumption with communication d...
Dejun Yang, Satyajayant Misra, Xi Fang, Guoliang X...