Narrow your search

Library

ULiège (10)

UNamur (10)

KU Leuven (9)

UCLouvain (6)

UHasselt (5)

ULB (5)

UAntwerpen (4)

UGent (4)

VUB (4)

UMons (3)

More...

Resource type

book (10)


Language

English (10)


Year
From To Submit

2006 (1)

2003 (1)

1994 (1)

1989 (1)

1988 (1)

More...
Listing 1 - 10 of 10
Sort by
Fractals everywhere
Author:
ISBN: 9780120790692 0120790696 Year: 2006 Publisher: San Diego: Morgan Kaufmann,

Geometric principles and procedures for computer graphic applications
Author:
ISBN: 0133525597 9780133525595 Year: 1978 Publisher: Englewood Cliffs: Prentice Hall,

Multiple view geometry in computer vision
Authors: ---
ISBN: 0521540518 9780521540513 Year: 2003 Publisher: Cambridge: Cambridge University Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

A basic problem in computer vision is to understand the structure of a real world scene given several images of it. Techniques for solving this problem are taken from projective geometry and photogrammetry. Here, the authors cover the geometric principles and their algebraic representation in terms of camera projection matrices, the fundamental matrix and the trifocal tensor. The theory and methods of computation of these entities are discussed with real examples, as is their use in the reconstruction of scenes from multiple images. The new edition features an extended introduction covering the key ideas in the book (which itself has been updated with additional examples and appendices) and significant new results which have appeared since the first edition. Comprehensive background material is provided, so readers familiar with linear algebra and basic numerical methods can understand the projective geometry and estimation algorithms presented, and implement the algorithms directly from the book.

Computational complexity
Author:
ISBN: 0201530821 9780201530827 Year: 1994 Publisher: Reading: Addison-Wesley,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Computability, complexity and languages : fundamentals of theoretical computer science
Authors: ---
ISBN: 0122063805 1322558671 1483264580 9780122063800 Year: 1983 Publisher: New York (N.Y.): Academic press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords

Machine theory --- Computational Complexity --- Formal languages --- Computational complexity --- 681.3*F11 --- 681.3*F2 --- 681.3*F4 --- 681.3*F41 --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics --- Formalization (Linguistics) --- Language and languages --- Complexity, Computational --- Electronic data processing --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Mathematical logic and formal languages (Theory of computation) --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F4 Mathematical logic and formal languages (Theory of computation) --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- 681.3*F11 Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Computable functions --- Fonctions calculables --- Fonctions calculables. --- Informatique --- Computer science --- Langages formels --- Langages de programmation --- Programming languages (Electronic computers) --- Computer science. --- Formal languages. --- Logique mathématique --- Algorithmique --- Complexite

Computers and intractability : a guide to the theory of NP-completeness
Authors: ---
ISBN: 0716710455 0716710447 9780716710448 9780716710455 Year: 1979 Publisher: San Francisco: Freeman,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords

Computational complexity. --- Computer algorithms. --- Computer programming. --- Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- 681.3*F13 Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- Computational complexity --- Computer algorithms --- Computer programming --- 510.5 --- 519.681 --- Computers --- Electronic computer programming --- Electronic data processing --- Electronic digital computers --- Programming (Electronic computers) --- Coding theory --- Algorithms --- Complexity, Computational --- Machine theory --- 519.681 Theory of programming --- Theory of programming --- 510.5 Algorithms. Computable functions --- Algorithms. Computable functions --- Programming --- #TCPW:boek --- 681.3*F13 --- 681.3*F2 --- Computer science --- Computational Complexity --- Programmation des ordinateurs --- Algorithmes --- Complexité de calcul (Informatique) --- Informatique --- Computer science. --- Electronic digital computers - Programming --- Algorithmique --- Complexite

Listing 1 - 10 of 10
Sort by