Sciweavers

1397 search results - page 26 / 280
» Algorithms for Proximity Problems on Colored Point Sets
Sort
View
MOR
2006
95views more  MOR 2006»
13 years 8 months ago
An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
Jörg Fliege
MONET
2011
13 years 3 months ago
On Adaptive Density Deployment to Mitigate the Sink-Hole Problem in Mobile Sensor Networks
Abstract The use of mobile sensors is of great relevance to monitor critical areas where sensors cannot be deployed manually. The presence of data collector sinks causes increased ...
Novella Bartolini, Tiziana Calamoneri, Annalisa Ma...
CVPR
2008
IEEE
14 years 10 months ago
Particle filtering for registration of 2D and 3D point sets with stochastic dynamics
In this paper, we propose a particle filtering approach for the problem of registering two point sets that differ by a rigid body transformation. Typically, registration algorithm...
Romeil Sandhu, Samuel Dambreville, Allen Tannenbau...
EOR
2010
133views more  EOR 2010»
13 years 8 months ago
A memetic algorithm for graph coloring
Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and th...
Zhipeng Lü, Jin-Kao Hao
ECCV
2004
Springer
14 years 10 months ago
A Correlation-Based Approach to Robust Point Set Registration
Correlation is a very effective way to align intensity images. We extend the correlation technique to point set registration using a method we call kernel correlation. Kernel corre...
Yanghai Tsin, Takeo Kanade