Le resume linguistique de donnees structurees comme ... - APMD

More documents

Recommendations

Info

156 BIBLIOGRAPHIEDans Uncertainty Management in Information Systems, pages 285–324. Kluwer AcademicPublishers, Boston, 1996.Disponible à l’adresseciteseer.nj.nec.com/bosc94introduction.html.[28] Bernadette BOUCHON-MEUNIER.La logique floue.Presses Universitaires de France, 3è édition, novembre 1999.[29] Jean-Marie BOUROCHE et Gilbert SAPORTA.L’analyse des données.Presses Universitaires de France, Paris, 1980.[30] Tolga BOZKAYA et Z. Meral ÖZSOYOGLU.Distance-based indexing for high-dimensional metric spaces.Dans Joan PECKHAM, réd., SIGMOD 1997, Proceedings ACM SIGMOD InternationalConference on Management of Data, May 13-15, 1997, Tucson, Arizona, USA, pages357–368. ACM Press, 1997.[31] Ronen I. BRAFMAN et Carmel DOMSHLAK.Database Preference Queries Revisited.Technical Report TR2004-1934, Cornell University Computing and Information Science,2004.[32] Gilles CELEUX, Edwin DIDAY, Gérard GOVAERT, Yves LECHEVALLIER et H. RALAM-BONDRAINY.Classification automatique des données - aspects statistiques et informatiques.Dunod Informatique. Bordas, Paris, 1989.[33] Kaushik CHAKRABARTI et Sharad MEHROTRA.The Hybrid Tree: an index structure for high dimensional feature spaces.Dans ICDE, pages 440–447, 1999.[34] Jan CHOMICKI.Querying with intrinsic preferences.Dans Proceedings of EDBT 2002, Prague, Czech Republic, pages 34–51, mars 2002.[35] Jan CHOMICKI.Preference formulas in relational queries.ACM Transactions on Database Systems, 28(4):427–466, 2003.[36] Wesley W. CHU, Hua YANG, Kuorong CHIANG, Michael MINOCK, Gladys CHOW etChris LARSON.
BIBLIOGRAPHIE 157CoBase: a scalable and extensible cooperative information system.Journal of Intelligent Information Systems, 6(2/3):223–259, 1996.Disponible à l’adresseciteseer.ist.psu.edu/chu96cobase.html.[37] Paolo CIACCIA, Marco PATELLA et Pavel ZEZULA.M-Tree: an efficient access method for similarity search in metric spaces.Dans VLDB’97, Proceedings of 23rd VLDB, Athens, Greece, pages 426–435, août 1997.[38] Philippe CIBOIS.L’analyse factorielle.Presses Universitaires de France, Paris, 1983.[39] William G. COCHRAN.Sampling techniques.Wiley & Sons, New York, 1977.[40] Edgar F. CODD.A relational model for large shared data banks.Communications of the ACM, 13(6):377–387, juin 1970.[41] Edgar F. CODD.Relational completeness of data base sublanguages.Dans Randall J. RUSTIN, réd., Data base Systems, pages 65–98. Prentice Hall, 1972.IBM Research Report RJ987.[42] Edgar F. CODD.Providing OLAP (On-Line Analytical Processing) to useranalysts: an IT mandate.Dans Technical Reports, 1993.[43] Douglas COMER.The ubiquitous B-Tree.ACM Computing Surveys, 11(2):121–137, 1979.[44] James W. COOLEY et John W. TUKEY.An algorithm for the machine calculation of complex Fourier series.Math. Comput, 19:297–301, 1965.[45] Antoine CORNUÉJOLS, Laurent MICLET et Yves KODRATOFF.Apprentissage artificiel: concepts et algorithmes.Eyrolles, Paris, 2002.[46] Juan C. CUBERO, Juan Miguel MEDINA, Olga PONS et María Amparo Vila MIRANDA.Data summarization in relational databases through fuzzy dependencies.
Page 1:
École Centrale de Nantes Universit
Page 5:
W. Amenel Abraham VOGLOZINLe résum
Page 9:
RemerciementsMes remerciements vont
Page 13 and 14:
IntroductionProblématique, motivat
Page 15 and 16:
Introduction 3du modèle SAINTETIQ,
Page 17:
Introduction 5structure d’index b
Page 20 and 21:
8 CHAPITRE 1 — Les résumés du m
Page 22 and 23:
10 CHAPITRE 1 — Les résumés du
Page 24 and 25:
Page 26 and 27:
Page 28:
Page 32 and 33:
Page 34 and 35:
Page 36 and 37:
Page 38 and 39:
Page 40 and 41:
28 CHAPITRE 2 — Algorithme d’in
Page 42 and 43:
Page 44 and 45:
Page 46 and 47:
Page 48 and 49:
Page 50 and 51:
Page 52 and 53:
Page 54 and 55:
Page 56 and 57:
44 CHAPITRE 3 — Interrogation fle
Page 58 and 59:
Page 60:
Page 65 and 66:
CHAPITRE 3 — Interrogation flexib
Page 67 and 68:
Page 69 and 70:
Page 71 and 72:
Page 73 and 74:
Page 75 and 76:
CHAPITRE 4Application des résumés
Page 77 and 78:
CHAPITRE 4 — Application des rés
Page 79 and 80:
Page 81 and 82:
Page 83 and 84:
Page 85 and 86:
Page 87 and 88:
Page 89 and 90:
Page 91 and 92:
Page 93 and 94:
Page 95 and 96:
Page 97 and 98:
Page 99 and 100:
Page 101:
Page 104 and 105:
92 CHAPITRE 5 — Indexation de don
Page 106 and 107:
Page 108 and 109:
Page 110 and 111:
Page 112 and 113:
100 CHAPITRE 5 — Indexation de do
Page 114 and 115:
Page 116 and 117:
Page 118 and 119: 106 CHAPITRE 5 — Indexation de do
Page 140 and 141: 128 CHAPITRE 6 — Implémentation
Page 161 and 162: Conclusion généraleRésuméDurant
Page 163 and 164: Conclusion générale 151tinence vi
Page 165 and 166: Bibliographie[1] Paul M. AOKI.Gener
Page 167: BIBLIOGRAPHIE 155Dans Proceedings o
Page 171 and 172: BIBLIOGRAPHIE 159ACM TODS, 4(3):315
Page 173 and 174: BIBLIOGRAPHIE 161R-trees: a dynamic
Page 175 and 176: BIBLIOGRAPHIE 163Dans Proeedings of
Page 177 and 178: BIBLIOGRAPHIE 165Thèse de doctorat
Page 179 and 180: BIBLIOGRAPHIE 167[135] THE POSTGRES
Page 181: BIBLIOGRAPHIE 169Information and Co
Page 185 and 186: Liste des figures—Corps du docume
Page 187 and 188: Table des matières—Corps du docu
Page 189 and 190: TABLE DES MATIÈRES 1775 Indexation
Page 192: Le résumé linguistique de donnée
show all

Le resume linguistique de donnees structurees comme ... - APMD

Create successful ePaper yourself

Delete template?

Save as template?