000 04475nam a22003735i 4500
001 291185
003 MX-SnUAN
005 20170705134222.0
007 cr nn 008mamaa
008 150903s2010 xxk| o |||| 0|eng d
020 _a9781849962902
_99781849962902
024 7 _a10.1007/9781849962902
_2doi
035 _avtls000344683
039 9 _a201509030404
_bVLOAD
_c201405050310
_dVLOAD
_y201402061303
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aTA1637-1638
100 1 _aGrady, Leo J.
_eautor
_9322354
245 1 0 _aDiscrete Calculus :
_bApplied Analysis on Graphs for Computational Science /
_cby Leo J. Grady, Jonathan R. Polimeni.
264 1 _aLondon :
_bSpringer London :
_bImprint: Springer,
_c2010.
300 _axvI, 366 páginas
_brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
500 _aSpringer eBooks
505 0 _aDiscrete Calculus: History and Future -- Discrete Calculus: History and Future -- A Brief Review of Discrete Calculus -- to Discrete Calculus -- Circuit Theory and Other Discrete Physical Models -- Applications of Discrete Calculus -- Building a Weighted Complex from Data -- Filtering on Graphs -- Clustering and Segmentation -- Manifold Learning and Ranking -- Measuring Networks.
520 _aThe field of discrete calculus, also known as "discrete exterior calculus", focuses on finding a proper set of definitions and differential operators that make it possible to operate the machinery of multivariate calculus on a finite, discrete space. In contrast to traditional goals of finding an accurate discretization of conventional multivariate calculus, discrete calculus establishes a separate, equivalent calculus that operates purely in the discrete space without any reference to an underlying continuous process. This unique text brings together into a single framework current research in the three areas of discrete calculus, complex networks, and algorithmic content extraction. Although there have been a few intersections in the literature between these disciplines, they have developed largely independently of one another, yet researchers working in any one of these three areas can strongly benefit from the tools and techniques being used in the others. Many example applications from several fields of computational science are provided to demonstrate the usefulness of this framework to a broad range of problems. Readers are assumed to be familiar with the basics of vector calculus, graph theory, and linear algebra. Topics and features: Presents a thorough review of discrete calculus, with a focus on key concepts required for successful application Unifies many standard image processing algorithms into a common framework for viewing a wide variety of standard algorithms in filtering, clustering, and manifold learning that may be applied to processing data associated with a graph or network Explains how discrete calculus provides a natural definition of "low-frequency" on a graph, which then yields filtering and denoising algorithms Discusses how filtering algorithms can give rise to clustering algorithms, which can be used to develop manifold learning and data discovery methods Examines ranking algorithms, as well as algorithms for analyzing the structure of a network Graduate students and researchers interested in discrete calculus, complex networks, image processing and computer graphics will find this text/reference a clear introduction to the foundations of discrete calculus as well as a useful guide to have readily available for their work. Dr. Leo J. Grady is a Senior Research Scientist with Siemens Corporate Research in Princeton, New Jersey, USA. Dr. Jonathan R. Polimeni is a Research Fellow at the Massachusetts General Hospital in Boston, Massachusetts, USA, and Instructor in Radiology at Harvard Medical School, Boston, Massachusetts, USA.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aPolimeni, Jonathan R.
_eautor
_9322355
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9781849962896
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-1-84996-290-2
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c291185
_d291185