Sciweavers

3708 search results - page 139 / 742
» Approximating Betweenness Centrality
Sort
View
ICRA
2010
IEEE
126views Robotics» more  ICRA 2010»
15 years 4 months ago
Planning short paths with clearance using explicit corridors
— A central problem of applications dealing with virtual environments is planning a collision-free path for a character. Since environments and their characters are growing more ...
Roland Geraerts
TGC
2010
Springer
15 years 4 months ago
A Novel Resource-Driven Job Allocation Scheme for Desktop Grid Environments
In this paper we propose a novel framework for the dynamic allocation of jobs in grid-like environments, in which such jobs are dispatched to the machines of the grid by a centrali...
Paolo Bertasi, Alberto Pettarin, Michele Scquizzat...
WD
2010
15 years 4 months ago
Centrality-based routing for Wireless Sensor Networks
The use of topological features, more specifically, the importance of an element related to its structural position is a subject widely studied. For instance, complex networks theo...
Eduardo M. R. Oliveira, Heitor S. Ramos, Antonio A...
ICASSP
2011
IEEE
14 years 10 months ago
Analysis of rate constraints for MWF-based noise reduction in acoustic sensor networks
In an acoustic sensor network, consisting of spatially distributed microphone nodes, a significant noise reduction can be achieved using the centralized multi-channel Wiener fil...
Toby Christian Lawin-Ore, Simon Doclo
CDC
2009
IEEE
118views Control Systems» more  CDC 2009»
15 years 11 months ago
Opportunistic scheduling in cellular systems in the presence of non-cooperative mobiles
Abstract— A central scheduling problem in wireless communications is that of allocating resources to one of many mobile stations that have a common radio channel. Much attention ...
Kavitha Veeraruna, Eitan Altman, Rachid El Azouzi,...