Sciweavers

446 search results - page 4 / 90
» Multiple voting location problems
Sort
View
ICPR
2002
IEEE
14 years 8 months ago
4-D Voting for Matching, Densification and Segmentation into Motion Layers
* We present a novel approach for grouping from motion, based on a 4-D Tensor Voting computational framework. From sparse point tokens in two frames we recover the dense velocity f...
Gérard G. Medioni, Mircea Nicolescu
TEC
2010
171views more  TEC 2010»
13 years 2 months ago
A Clustering Particle Swarm Optimizer for Locating and Tracking Multiple Optima in Dynamic Environments
In the real world, many optimization problems are dynamic. This requires an optimization algorithm to not only find the global optimal solution under a specific environment but als...
Shengxiang Yang, Changhe Li
WINE
2010
Springer
149views Economy» more  WINE 2010»
13 years 5 months ago
Winner-Imposing Strategyproof Mechanisms for Multiple Facility Location Games
We study Facility Location games, where a number of facilities are placed in a metric space based on locations reported by strategic agents. A mechanism maps the agents' locat...
Dimitris Fotakis, Christos Tzamos
ICRA
2010
IEEE
101views Robotics» more  ICRA 2010»
13 years 5 months ago
Searching for objects: Combining multiple cues to object locations using a maximum entropy model
— In this paper, we consider the problem of how background knowledge about usual object arrangements can be utilized by a mobile robot to more efficiently find an object in an ...
Dominik Joho, Wolfram Burgard
ICC
2007
IEEE
118views Communications» more  ICC 2007»
14 years 1 months ago
Single and Multiple Parameters Sensitivity Study of Location Management Area Partitioning for GSM Networks
–- To obtain optimal location area (LA) partitioning in cellular radio networks is important since it maximizes the usable bandwidth to support services. However, we feel that th...
Yong Huat Chew, Boon Sain Yeo, Daniel Chien Ming K...