Sciweavers

3136 search results - page 355 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
ICANN
2003
Springer
16 years 15 days ago
Expectation-MiniMax Approach to Clustering Analysis
Abstract. This paper proposes a general approach named ExpectationMiniMax (EMM) for clustering analysis without knowing the cluster number. It describes the contrast function of Ex...
Yiu-ming Cheung
CVPR
2010
IEEE
16 years 13 days ago
Exploiting Global Connectivity Constraints for Reconstruction of 3D Line Segments from Images
Given a set of 2D images, we propose a novel approach for the reconstruction of straight 3D line segments that represent the underlying geometry of static 3D objects in the scene....
Arjun Jain, Christian Kurz, Thorsten Thormaehlen, ...
IPPS
2002
IEEE
16 years 6 days ago
A Recursion-Based Broadcast Paradigm in Wormhole Routed Mesh/Torus Networks
: A novel broadcast technique for wormhole-routed mesh and torus parallel computers based on recursion is presented in this paper. It works by partitioning the graph into several s...
Xiaotong Zhuang, Vincenzo Liberatore
WACV
2002
IEEE
16 years 6 days ago
Optimal motion estimation from visual and inertial measurements
Cameras and inertial sensors are good candidates to be deployed together for autonomous vehicle motion estimation, since each can be used to resolve the ambiguities in the estimat...
Dennis Strelow, Sanjiv Singh
GECCO
2010
Springer
190views Optimization» more  GECCO 2010»
16 years 2 days ago
Comparing the (1+1)-CMA-ES with a mirrored (1+2)-CMA-ES with sequential selection on the noiseless BBOB-2010 testbed
In this paper, we compare the (1+1)-CMA-ES to the (1+2s m)CMA-ES, a recently introduced quasi-random (1+2)-CMAES that uses mirroring as derandomization technique as well as a sequ...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen