Sciweavers

606 search results - page 78 / 122
» Complexity Results for Checking Distributed Implementability
Sort
View
ICRA
2005
IEEE
128views Robotics» more  ICRA 2005»
15 years 7 months ago
Hoplites: A Market-Based Framework for Planned Tight Coordination in Multirobot Teams
— In this paper we address tasks for multirobot teams that require solving a distributed multi-agent planning problem in which the actions of robots are tightly coupled. The unce...
Nidhi Kalra, Dave Ferguson, Anthony Stentz
SDMW
2004
Springer
15 years 7 months ago
Experimental Analysis of Privacy-Preserving Statistics Computation
The recent investigation of privacy-preserving data mining and other kinds of privacy-preserving distributed computation has been motivated by the growing concern about the privacy...
Hiranmayee Subramaniam, Rebecca N. Wright, Zhiqian...
ATAL
2010
Springer
15 years 2 months ago
Point-based policy generation for decentralized POMDPs
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
Feng Wu, Shlomo Zilberstein, Xiaoping Chen
CVPR
2012
IEEE
13 years 4 months ago
Saliency filters: Contrast based filtering for salient region detection
Saliency estimation has become a valuable tool in image processing. Yet, existing approaches exhibit considerable variation in methodology, and it is often difficult to attribute...
Federico Perazzi, Philipp Krähenbühl, Ya...
BMCBI
2010
110views more  BMCBI 2010»
15 years 1 months ago
On the use of resampling tests for evaluating statistical significance of binding-site co-occurrence
Background: In eukaryotes, most DNA-binding proteins exert their action as members of large effector complexes. The presence of these complexes are revealed in high-throughput gen...
David S. Huen, Steven Russell