Sciweavers

267 search results - page 30 / 54
» Efficient and decentralized computation of approximate globa...
Sort
View
MOBIHOC
2010
ACM
14 years 9 months ago
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
Anne-Marie Kermarrec, Guang Tan
BC
2005
127views more  BC 2005»
14 years 11 months ago
Computational modeling and exploration of contour integration for visual saliency
Abstract Weproposeacomputationalmodelofcontourintegration for visual saliency. The model uses biologically plausible devices to simulate how the representations of elements aligned...
T. Nathan Mundhenk, Laurent Itti
ICPR
2004
IEEE
16 years 27 days ago
Parameterisation Invariant Statistical Shape Models
In this paper novel theory to automate shape modelling is described. The main idea is to develop a theory that is intrinsically defined for curves, as opposed to a finite sample o...
Johan Karlsson, Anders Ericsson, Kalle Åstr&...
AAAI
1994
15 years 1 months ago
Exploiting Meta-Level information in a Distributed Scheduling System
In this paper, we study the problem of achieving efficient interaction in a distributed scheduling system whose scheduling agents may borrow resources from one another. Specifical...
Daniel E. Neiman, David W. Hildum, Victor R. Lesse...
UAI
1998
15 years 1 months ago
Hierarchical Solution of Markov Decision Processes using Macro-actions
tigate the use of temporally abstract actions, or macro-actions, in the solution of Markov decision processes. Unlike current models that combine both primitive actions and macro-...
Milos Hauskrecht, Nicolas Meuleau, Leslie Pack Kae...