Sciweavers

485 search results - page 79 / 97
» Unconstraint Assignment Problem: A Molecular Computing Appro...
Sort
View
PAMI
2007
127views more  PAMI 2007»
13 years 7 months ago
Stereo Correspondence with Occlusion Handling in a Symmetric Patch-Based Graph-Cuts Model
—A novel patch-based correspondence model is presented in this paper. Many segment-based correspondence approaches have been proposed in recent years. Untextured pixels and bound...
Yi Deng, Qiong Yang, Xueyin Lin, Xiaoou Tang
CEC
2010
IEEE
13 years 7 months ago
Designing airfoils using a reference point based evolutionary many-objective particle swarm optimization algorithm
— In this paper, we illustrate the use of a reference point based many-objective particle swarm optimization algorithm to optimize low-speed airfoil aerodynamic designs. Our fram...
Upali K. Wickramasinghe, Robert Carrese, Xiaodong ...
ICML
2009
IEEE
14 years 8 months ago
Multi-assignment clustering for Boolean data
Conventional clustering methods typically assume that each data item belongs to a single cluster. This assumption does not hold in general. In order to overcome this limitation, w...
Andreas P. Streich, Mario Frank, David A. Basin, J...
IROS
2009
IEEE
229views Robotics» more  IROS 2009»
14 years 2 months ago
3D mapping for urban service robots
— We present an approach to the problem of 3D map building in urban settings for service robots, using threedimensional laser range scans as the main data input. Our system is ba...
Rafael Valencia, Ernesto Homar Teniente Avil&eacut...
CP
2007
Springer
13 years 11 months ago
On Inconsistent Clause-Subsets for Max-SAT Solving
Recent research has focused on using the power of look-ahead to speed up the resolution of the Max-SAT problem. Indeed, look-ahead techniques such as Unit Propagation (UP) allow to...
Sylvain Darras, Gilles Dequen, Laure Devendeville,...