Sciweavers

989 search results - page 121 / 198
» Approximating the Pareto optimal set using a reduced set of ...
Sort
View
IJCV
2006
142views more  IJCV 2006»
13 years 8 months ago
Geometry and Convergence Analysis of Algorithms for Registration of 3D Shapes
The computation of a rigid body transformation which optimally aligns a set of measurement points with a surface and related registration problems are studied from the viewpoint o...
Helmut Pottmann, Qi-Xing Huang, Yong-Liang Yang, S...
PUK
2003
13 years 9 months ago
On the Decomposition and Concurrent Resolution of a Planning Problem
Planning is known to be a difficult task. One of the approaches used to reduce this difficulty is problem decomposition under divide-and-conquer methodology. This paper introduce...
Laura Sebastia, Eva Onaindia, Eliseo Marzal
ICANN
2007
Springer
13 years 12 months ago
An Efficient Search Strategy for Feature Selection Using Chow-Liu Trees
Within the taxonomy of feature extraction methods, recently the Wrapper approaches lost some popularity due to the associated computational burden, compared to Embedded or Filter m...
Erik Schaffernicht, Volker Stephan, Horst-Michael ...
GLOBECOM
2009
IEEE
13 years 12 months ago
Multi-Commodity Flow Traffic Engineering with Hybrid MPLS/OSPF Routing
A common objective of Internet traffic engineering is to minimize the maximal link utilization in a network in order to accommodate more traffic and reduce the chance of congestion...
Mingui Zhang, Bin Liu, Beichuan Zhang
CIDU
2010
13 years 5 months ago
Optimal Partitions of Data In Higher Dimensions
Given any collection of data cells in a data space X, consider the problem of finding the optimal partition of the data cells into blocks which are unions of cells. The algorithms...
Bradley W. Jackson, Jeffrey D. Scargle, Chris Cusa...