Sciweavers

3281 search results - page 376 / 657
» Bases for parametrized iterativity
Sort
View
ANOR
2011
117views more  ANOR 2011»
14 years 10 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
3DIM
2011
IEEE
14 years 6 months ago
Sampling Relevant Points for Surface Registration
—Surface registration is a fundamental step in the reconstruction of three-dimensional objects. This is typically a two-step process where an initial coarse motion estimation is ...
Andrea Torsello, Emanuele Rodolà, Andrea Al...
ATAL
2011
Springer
14 years 6 months ago
Solving Stackelberg games with uncertain observability
Recent applications of game theory in security domains use algorithms to solve a Stackelberg model, in which one player (the leader) first commits to a mixed strategy and then th...
Dmytro Korzhyk, Vincent Conitzer, Ronald Parr
ECCV
2002
Springer
16 years 8 months ago
Building Roadmaps of Local Minima of Visual Models
Getting trapped in suboptimal local minima is a perennial problem in model based vision, especially in applications like monocular human body tracking where complex nonlinear para...
Cristian Sminchisescu, Bill Triggs
ICDE
2001
IEEE
149views Database» more  ICDE 2001»
16 years 8 months ago
Selectivity Estimation for Spatial Joins
Spatial Joins are important and time consuming operations in spatial database management systems. It is crucial to be able to accurately estimate the performance of these operatio...
Ning An, Zhen-Yu Yang, Anand Sivasubramaniam