Listing 1 - 10 of 10 |
Sort by
|
Choose an application
Global analysis (Mathematics) --- Differentiable dynamical systems. --- Fractals --- Analyse globale (mathématiques) --- Géométrie algorithmique --- Systèmes dynamiques --- Fractales --- Géométrie algorithmique. --- Systèmes dynamiques. --- Fractales. --- Analyse globale (mathématiques) --- Géométrie algorithmique. --- Systèmes dynamiques.
Choose an application
Artificial intelligence. Robotics. Simulation. Graphics --- Computer graphics --- Geometry, Analytic --- Infographie --- Géométrie analytique --- #TCPW P4.0 --- #TCPW P4.5 --- #WSCH:AAS2 --- 681.3*J35 --- Computerwetenschap--?*J35 --- Analytical geometry --- Geometry, Algebraic --- Algebra --- Conic sections --- Automatic drafting --- Graphic data processing --- Graphics, Computer --- Computer art --- Graphic arts --- Electronic data processing --- Engineering graphics --- Image processing --- Graphic methods --- Digital techniques --- Computer graphics. --- Géométrie algorithmique --- Géométrie algorithmique --- Constructions geometriques
Choose an application
Stochastic processes --- Analytical topology --- Geometry --- Fractales --- Fractals --- 517.987 --- #WSCH:MODS --- #TELE:SISTA --- #WPLT:dd.Prof.F.Symons --- Fractal geometry --- Fractal sets --- Geometry, Fractal --- Sets, Fractal --- Sets of fractional dimension --- Dimension theory (Topology) --- Measures. Representations of Boolean algebras. Metric theory of dynamic systems --- Fractals. --- Basic Sciences. Mathematics --- Geometry, Topology --- Geometry, Topology. --- 517.987 Measures. Representations of Boolean algebras. Metric theory of dynamic systems --- Global analysis (Mathematics) --- Differentiable dynamical systems. --- Analyse globale (mathématiques) --- Géométrie algorithmique --- Systèmes dynamiques --- Géométrie algorithmique. --- Systèmes dynamiques. --- Fractales. --- Analyse globale (mathématiques) --- Géométrie algorithmique. --- Systèmes dynamiques.
Choose an application
AA / International- internationaal --- 302 --- Opmaak en presentatie van statistische reeksen en tabellen. Grafieken. --- Curve fitting --- Interpolation --- Spline theory --- 519.6 --- 519.6 Computational mathematics. Numerical analysis. Computer programming --- Computational mathematics. Numerical analysis. Computer programming --- Spline functions --- Approximation theory --- Fitting, Curve --- Numerical analysis --- Least squares --- Smoothing (Numerical analysis) --- Statistics --- Graphic methods --- Numerical approximation theory --- Opmaak en presentatie van statistische reeksen en tabellen. Grafieken --- Approximation, Théorie de l' --- Géométrie algorithmique --- Approximation, Théorie de l' --- Géométrie algorithmique --- Interpolation (mathématiques)
Choose an application
Combinatorial geometry --- Geometrie combinatoire --- Meetkunde [Combinatorische ] --- Geometry --- Data processing --- 519.11 --- -Mathematics --- Euclid's Elements --- Geometric combinatorics --- Geometrical combinatorics --- Combinatorial analysis --- Discrete geometry --- Classical combinatorial theory and problems. Factorials. Partitions --- -Classical combinatorial theory and problems. Factorials. Partitions --- 519.11 Classical combinatorial theory and problems. Factorials. Partitions --- -Geometric combinatorics --- Géométrie algorithmique --- Géometrie convexe --- Geometry - Data processing
Choose an application
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.
Computer vision --- Geometry, Projective --- Projective geometry --- Geometry, Modern --- Machine vision --- Vision, Computer --- Artificial intelligence --- Image processing --- Pattern recognition systems --- Computer. Automation --- Geometry --- robots --- grafische computerprogramma's --- Artificial intelligence. Robotics. Simulation. Graphics --- geometrie --- 2D computertoepassingen --- Geometry, projective --- Computer vision. --- Geometry, Projective. --- KI (kunstmatige intelligentie) --- Artificial intelligence. --- Image processing. --- Géométrie algorithmique --- Traitement d'images. --- Vision par ordinateur --- Géométrie projective
Choose an application
Computer science --- Computational Complexity --- 681.3*I --- #TELE:SISTA --- 681.3*F13 --- Computing methodologies --- 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} --- 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} --- 681.3*I Computing methodologies --- Computational complexity --- 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} --- 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} --- Complexity, Computational --- Electronic data processing --- Machine theory --- Computational complexity. --- Complexité de calcul (Informatique) --- Informatique --- Computer science. --- Algorithmique --- Algorithmes --- Complexite
Choose an application
Logic programming --- Programmation logique --- Logic Programming --- Constraint programming (Computer science) --- 681.3*I23 --- 681.3*I28 --- Computer programming --- Deduction and theorem proving: answer/reason extraction; reasoning; resolution; metatheory; mathematical induction; logic programming (Artificial intelligence) --- Problem solving, control methods and search: backtracking; dynamic program- ming; graph and tree search strategies; heuristics; plan execution, formationand generation (Artificial intelligence)--See also {681.3*F22} --- Logic programming. --- Constraint programming (Computer science). --- 681.3*I28 Problem solving, control methods and search: backtracking; dynamic program- ming; graph and tree search strategies; heuristics; plan execution, formationand generation (Artificial intelligence)--See also {681.3*F22} --- 681.3*I23 Deduction and theorem proving: answer/reason extraction; reasoning; resolution; metatheory; mathematical induction; logic programming (Artificial intelligence) --- Informatique --- Computer science --- Computer science. --- Algorithmique --- Informatique theorique
Choose an application
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
Choose an application
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
|