Tous nos rayons

Déjà client ? Identifiez-vous

Mot de passe oublié ?

Nouveau client ?

CRÉER VOTRE COMPTE
External Memory Algorithms
Ajouter à une liste

Librairie Eyrolles - Paris 5e
Indisponible

External Memory Algorithms

External Memory Algorithms

Alexandra Abello

306 pages, parution le 01/01/1999

Résumé

The AMS and DIMACS are pleased to present this 50th volume in the DIMACS series. This series contains volumes coming out of programs at the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS), which is headquartered at Rutgers University in partnership with Princeton University, AT&T Labs-Research, Bell Labs (Lucent Technologies), NEC Research Institute, and Telcordia Technologies (formerly Bellcore). The series includes topics on research and education concerning areas such as discrete and computational geometry, discrete optimization, data structures and algorithms, computational intractability, massive data sets, networks, graph theory, combinatorics, computational number theory and cryptology, discrete probability, recursive function theory and mathematical logic, Boolean functions, computational and mathematical biology, and computational algebra.

Contents

  • External memory algorithms and data structures
    JEFFREY SCOTT VITTER
  • Synopsis data structures for massive -data sets
    PHILLIP B. GIBBONS AND YOSSI MATIAS
  • Calculating robust depth measures for large data sets
    IBRAHEEM AL-FURAIH, THEODORE JOHNSON, AND SANJAY RANKA
  • Efficient crosstrees for external memory
    ROBERTO GROSSI AND GIUSEPPE F. ITALIANO
  • Computing on data streams
    MONIKA R. HENZINGER, PRABHAKAR RAGHAVAN, AND SRIDHAR RAJAGOPALAN
  • On maximum clique problems in very large graphs
    J. ABELLO, P. PARDALOS, AND M. G. C. RESENDE
  • I/0-optimal computation of segment intersections
    A. CRAUSER, P. FERRAGINA, K. MEHLHORN, U. MEYER, AND E. A. RAMOS
  • On showing lower bounds for external-memory computational geometry problems
    LARS ARGE AND PETER BRO MILTERSEN
  • A survey of out-of-core algorithms in numerical linear algebra
    SIVAN TOLEDO
  • Concrete software libraries
    KIEM-PHONG VO
  • S(b)-tree library: An efficient way of indexing data
    KONSTANTIN V. SHVACHKO
  • ASP: Adaptive online parallel disk scheduling
    MAHESH KALLAHALLA AND PETER J. VARMAN
  • Efficient schemes for distributing data on parallel memory systems
    SAJAL K. DAS AND M.CRISTINA PINOTTI
  • External memory techniques for isosurface extraction in scientific visualization
    YI-JEN CHIANG AND CLAUDIO T.SILVA
  • R-tree retrieval of unstructured volume data for visualization
    SCOTT T. LEUTENEGGER AND KWAN-LIU MA

L'auteur - Alexandra Abello

Autres livres de Alexandra Abello

Caractéristiques techniques

  PAPIER
Éditeur(s) American Mathematical Society (AMS)
Auteur(s) Alexandra Abello
Parution 01/01/1999
Nb. de pages 306
Format 18 x 26
Couverture Relié
Poids 768g
Intérieur Noir et Blanc
EAN13 9780821811849

Avantages Eyrolles.com

Livraison à partir de 0,01 en France métropolitaine
Paiement en ligne SÉCURISÉ
Livraison dans le monde
Retour sous 15 jours
+ d'un million et demi de livres disponibles
satisfait ou remboursé
Satisfait ou remboursé
Paiement sécurisé
modes de paiement
Paiement à l'expédition
partout dans le monde
Livraison partout dans le monde
Service clients 0 321 79 56 75 sav@commande.eyrolles.com
librairie française
Librairie française depuis 1925