1242 search results - page 217 / 249 » A Computational Complexity Theory in Membrane Computing |
MOBIHOC
2004
ACM
14 years 7 months ago
2004
ACM
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
SAC
2010
ACM
14 years 2 months ago
2010
ACM
This paper presents a random finite set theoretic formulation for multi-object tracking as perceived by a 3D-LIDAR in a dynamic environment. It is mainly concerned with the joint...
BIRTHDAY
2009
Springer
14 years 2 months ago
2009
Springer
Super-resolution is the art of creating nice high-resolution raster images from given low-resolution raster images. Since “nice” is not a well-defined term in mathematics and ...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— The question of whether or not parallel repetition reduces the soundness error is a fundamental question in the theory of protocols. While parallel repetition reduces (at an ex...
PRDC
2009
IEEE
14 years 2 months ago
2009
IEEE
—With ever-growing complexity of computer and communication systems analytical methods do not scale, especially with respect to dependability assessment of information technology...