Sciweavers

2168 search results - page 321 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
SAC
2010
ACM
15 years 3 months ago
Chemotaxis-based sorting of self-organizing heterotypic agents
Cell sorting is a fundamental phenomenon in morphogenesis, which is the process that leads to shape formation in living organisms. The sorting of heterotypic cell populations is p...
Manolya Eyiyurekli, Linge Bai, Peter I. Lelkes, Da...
CORR
2008
Springer
88views Education» more  CORR 2008»
15 years 3 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg
EC
2008
209views ECommerce» more  EC 2008»
15 years 3 months ago
Human Body Pose Estimation with Particle Swarm Optimisation
In this paper we address the problem of human body pose estimation from still images. A multi-view set of images of a person sitting at a table is acquired and the pose estimated....
Spela Ivekovic, Emanuele Trucco, Yvan R. Petillot
133
Voted
PIMRC
2010
IEEE
15 years 1 months ago
Low-complexity admission control for distributed power-controlled networks with stochastic channels
This study addresses the general problem of efficient resource management in wireless networks with arbitrary timevarying topologies. Communication channels are assumed to generall...
Stepán Kucera, Bing Zhang
IEEESCC
2009
IEEE
15 years 1 months ago
Theoretical Framework for Eliminating Redundancy in Workflows
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sara...