194 search results - page 16 / 39 » Computing Roundness is Easy if the Set is Almost Round |
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Whenever rational agents form coalitions to execute tasks, doing so via a decentralized negotiation process—while more robust and democratic—may lead to a loss of efficiency ...
ESA
2007
Springer
13 years 11 months ago
2007
Springer
A token is hidden in one out of n boxes following some known probability distribution and then all the boxes are locked. The goal of a searcher is to find the token in at most D n...
ICMCS
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper, we present an integrated system for news video retrieval. The proposed system incorporates both speech and visual information in the search mechanisms. The initial ...
PODC
2011
ACM
12 years 10 months ago
2011
ACM
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
GIS
2010
ACM
13 years 5 months ago
2010
ACM
Map matching is a fundamental operation in many applications such as traffic analysis and location-aware services, the killer apps for ubiquitous computing. In the past, several m...