Sciweavers

284 search results - page 32 / 57
» What Matchings Can Be Stable
Sort
View
ICRA
2005
IEEE
125views Robotics» more  ICRA 2005»
14 years 2 months ago
A Robust Localization Algorithm for Mobile Robots with Laser Range Finders
– We present a robust localization algorithm for mobile robots with laser range finders, which takes featurebased approach for reliable matching process as well as pointbased app...
Hee Jin Sohn, Byung Kook Kim
ALGORITHMICA
2005
102views more  ALGORITHMICA 2005»
13 years 8 months ago
Effective Routing and Scheduling in Adversarial Queueing Networks
In an adversarial queueing network, the incoming traffic is decided by an adversary, who operates under a reasonable rate restriction. This model provides a valuable, complementar...
Jay Sethuraman, Chung-Piaw Teo
CDC
2010
IEEE
133views Control Systems» more  CDC 2010»
13 years 3 months ago
Decentralized task assignment in camera networks
The problem of task assignment naturally arises in multiagent multitask systems, where an optimal matching of agents and tasks is sought. This problem is a combinatorial optimizati...
Angelo Cenedese, Federico Cerruti, Mirko Fabbro, C...
CVIU
2011
13 years 14 hour ago
Graph-based quadratic optimization: A fast evolutionary approach
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
Samuel Rota Bulò, Marcello Pelillo, Immanue...
IJMMS
2006
90views more  IJMMS 2006»
13 years 8 months ago
A framework for asynchronous change awareness in collaborative documents and workspaces
Change awareness is the ability of individuals to track the asynchronous changes made to a collaborative document or graphical workspace by other participants over time. We develo...
James Tam, Saul Greenberg