Sciweavers

1578 search results - page 240 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
PR
2006
101views more  PR 2006»
13 years 10 months ago
Efficient Legendre moment computation for grey level images
9 Legendre orthogonal moments have been widely used in the field of image analysis. Because their computation by a direct method is very time expensive, recent efforts have been d...
G. Y. Yang, Huazhong Shu, Christine Toumoulin, Guo...
WS
2006
ACM
14 years 4 months ago
Modeling Ad-hoc rushing attack in a negligibility-based security framework
In this paper, we propose a formal notion of network security for ad hoc networks. We adopt a probabilistic security framework, that is, security is defined by a polynomially bou...
Jiejun Kong, Xiaoyan Hong, Mario Gerla
ATAL
2010
Springer
13 years 11 months ago
Coalition formation with spatial and temporal constraints
The coordination of emergency responders and robots to undertake a number of tasks in disaster scenarios is a grand challenge for multi-agent systems. Central to this endeavour is...
Sarvapali D. Ramchurn, Maria Polukarov, Alessandro...
IPSN
2007
Springer
14 years 4 months ago
Sparse data aggregation in sensor networks
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
SPAA
2006
ACM
14 years 4 months ago
Towards a scalable and robust DHT
The problem of scalable and robust distributed data storage has recently attracted a lot of attention. A common approach in the area of peer-to-peer systems has been to use a dist...
Baruch Awerbuch, Christian Scheideler