m
• E

F Nous contacter

0

# Documents  68W01 | enregistrements trouvés : 7

O

P Q

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Condition: the geometry of numerical algorithms - Lecture 1 Bürgisser, Peter | CIRM H

Post-edited

Research talks;Computer Science

The performance of numerical algorithms, both regarding stability and complexity, can be understood in a unified way in terms of condition numbers. This requires to identify the appropriate geometric settings and to characterize condition in geometric ways.
A probabilistic analysis of numerical algorithms can be reduced to a corresponding analysis of condition numbers, which leads to fascinating problems of geometric probability and integral geometry. The most well known example is Smale's 17th problem, which asks to find a solution of a given system of n complex homogeneous polynomial equations in $n$ + 1 unknowns. This problem can be solved in average (and even smoothed) polynomial time.
In the course we will explain the concepts necessary to state and solve Smale's 17th problem. We also show how these ideas lead to new numerical algorithms for computing eigenpairs of matrices that provably run in average polynomial time. Making these algorithms more efficient or adapting them to structured settings are challenging and rewarding research problems. We intend to address some of these issues at the end of the course.
The performance of numerical algorithms, both regarding stability and complexity, can be understood in a unified way in terms of condition numbers. This requires to identify the appropriate geometric settings and to characterize condition in geometric ways.
A probabilistic analysis of numerical algorithms can be reduced to a corresponding analysis of condition numbers, which leads to fascinating problems of geometric probability and integral ...

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Extrenal memory algorithms :DIMACS workshop on ... held at Ruthgers University#May 20-22 Abello, James M. ; Vitter, Jeffrey Scott | American Mathematical Society 1999

Congrès

- 306 p.
ISBN 978-0-8218-1184-9

DIMACS series in discrete mathematics and theoretical computer science , 0050

Localisation : Collection 1er étage

algorithme de calcul # algorithme numérique # algorithmique # algèbre numérique # calcul des algorithmes numériques # calcul parallèle # complexité des algorithmes # gestion de mémoire # infographie # informatique théorique # mathématique discrète # modèle de calcul # structure des données # traitement des données

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Data structures, near neighbor searches, and methodology :fifth and sixth DIMACS implementation challenges#papers related to the 5th DIMACS challenge on dictionaries and priority queues#Oct. 28-30 and the 6th DIMACS challenge on near neighbor searches#Jan. 15 Goldwasser, Michael H. ; Johnson, David S. ; McGeoch, Catherine C. | American Mathematical Society 2002

Congrès

- 256 p.
ISBN 978-0-8218-2892-2

DIMACS series in discrete mathematics and theorerical computer science , 0059

Localisation : Collection 1er étage

informatique # structure de données # algorithme # recherche # tri # géométrie assistée par ordinateur # évaluation de performance # priorité # queue # plus proche voisin # recherche d'information # WAB # ADN # image

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Condition: the geometry of numerical algorithms - Lecture 2 Bürgisser, Peter | CIRM H

Multi angle

Research talks;Computer Science

The performance of numerical algorithms, both regarding stability and complexity, can be understood in a unified way in terms of condition numbers. This requires to identify the appropriate geometric settings and to characterize condition in geometric ways.
A probabilistic analysis of numerical algorithms can be reduced to a corresponding analysis of condition numbers, which leads to fascinating problems of geometric probability and integral geometry. The most well known example is Smale's 17th problem, which asks to find a solution of a given system of n complex homogeneous polynomial equations in $n$ + 1 unknowns. This problem can be solved in average (and even smoothed) polynomial time.
In the course we will explain the concepts necessary to state and solve Smale's 17th problem. We also show how these ideas lead to new numerical algorithms for computing eigenpairs of matrices that provably run in average polynomial time. Making these algorithms more efficient or adapting them to structured settings are challenging and rewarding research problems. We intend to address some of these issues at the end of the course.
The performance of numerical algorithms, both regarding stability and complexity, can be understood in a unified way in terms of condition numbers. This requires to identify the appropriate geometric settings and to characterize condition in geometric ways.
A probabilistic analysis of numerical algorithms can be reduced to a corresponding analysis of condition numbers, which leads to fascinating problems of geometric probability and integral ...

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Efficient graph representations Spinrad, Jeremy P. | American Mathematical Society 2003

Ouvrage

- 341 p.
ISBN 978-0-8218-2815-1

Fields institute monographs , 0019

Localisation : Collection 1er étage;Réserve

combinatoire # informatique # théorie des graphes # algorithme # représentation des graphes # complexité # optimisation

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Introduction to the design and analysis of algorithms:a strategic approach Lee, R. C. T. ; Tseng, S. S. ; Chang, R. C. ; Tsai, Y. T. | McGraw-Hill Education 2005

Ouvrage

- xxv; 723 p.
ISBN 978-0-07-127524-8

Localisation : Ouvrage RdC (INTR)

algorithmes # complexité # programmation dynamique # arbre # stratégie

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Nine algorithms that changed the future:the ingenious ideas that drive today's computers MacCormick, John ; Bishop, Chris | Princeton University Press 2012

Ouvrage

- x; 219 p.
ISBN 978-0-691-14714-7

Localisation : Ouvrage RdC (MACC)

intelligence artificielle # algorithme # informatique # moteur de recherche # index # Google # reconnaissance de motifs # vulgarisation # cryptage

#### Filtrer

##### Codes MSC

Ressources Electroniques (Depuis le CIRM)

Books & Print journals

Recherche avancée

0
Z