Sciweavers

528 search results - page 45 / 106
» Degrees of categoricity of computable structures
Sort
View
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
13 years 9 months ago
How social structure and institutional order co-evolve beyond instrumental rationality
This study proposes an agent-based model where adaptively learning agents with local vision who are situated in the Prisoner’s Dilemma game change their strategy and location as...
Jae-Woo Kim
BMVC
2002
13 years 11 months ago
Bundle adjustment: a fast method with weak initialisation
Bundle adjustment is one of the cornerstone to recover the scene structure from a sequence of images. The main drawback of this technique, due to nonlinear optimisation, is the ne...
Sébastien Cornou, Michel Dhome, Patrick Say...
MFCS
2007
Springer
14 years 2 months ago
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
Jaroslav Nesetril, Mark H. Siggers
CALCO
2005
Springer
104views Mathematics» more  CALCO 2005»
14 years 2 months ago
Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories
Scalars, Loops, and Free Traced and Strongly Compact Closed Categories Samson Abramsky Oxford University Computing Laboratory Wolfson Building, Parks Road, Oxford OX1 3QD, U.K. htt...
Samson Abramsky
CVPR
2003
IEEE
14 years 10 months ago
An Efficient Solution to the Five-Point Relative Pose Problem
An efficient algorithmic solution to the classical five-point relative pose problem is presented. The problem is to find the possible solutions for relative camera motion between ...
David Nistér