000 | 08403nam a2201609 i 4500 | ||
---|---|---|---|
001 | 5201533 | ||
003 | IEEE | ||
005 | 20220712205547.0 | ||
006 | m o d | ||
007 | cr |n||||||||| | ||
008 | 080625t20152008nju ob 001 0 eng d | ||
020 |
_a9780470175668 _qelectronic |
||
020 |
_z9780470044926 _qpaper |
||
020 |
_z0470175664 _qelectronic |
||
024 | 7 |
_a10.1002/9780470175668 _2doi |
|
035 | _a(CaBNVSL)mat05201533 | ||
035 | _a(IDAMS)0b0000648104a9f6 | ||
040 |
_aCaBNVSL _beng _erda _cCaBNVSL _dCaBNVSL |
||
050 | 4 |
_aQA76.9.A43 _bH353 2008eb |
|
082 | 0 |
_a005.1 _222 |
|
245 | 0 | 0 |
_aHandbook of applied algorithms : _bsolving scientific, engineering and practical problems / _cedited by Amiya Nayak, Ivan Stojmenovi�c. |
264 | 1 |
_aHoboken, New Jersey : _bWiley-Interscience, _cc2008. |
|
264 | 2 |
_a[Piscataqay, New Jersey] : _bIEEE Xplore, _c2007. |
|
300 | _a1 PDF (584 pages). | ||
336 |
_atext _2rdacontent |
||
337 |
_aelectronic _2isbdmedia |
||
338 |
_aonline resource _2rdacarrier |
||
505 | 0 | _aPreface -- Abstracts -- Contributors -- 1. Generating All and Random Instances of A combinatorial Object (Ivan Stojmenovic) -- 2. Backtracking and Isomorph-Free Generation of Polyhexes (Lucia Moura and Ivan Stojmenovic) -- 3. Graph Theoretic Models in Chemistry and Molecular Biology (Debra Knisley and Jeff Knisley) -- 4. Algorithmic Methods for the Analysis of Gene Expression Data (Hongbo Xie, Uros Midic, Slobodan Vucetic, and Zoran Obradovic) -- 5. Algorithms of Reaction-Diffusion Computing (Andrew Adamatzky) -- 6. Data Mining Algorithms I: Clustering (Dan A. Simovici) -- 7. Data Mining Algorithms II: Frequent Item Sets (Dan A. Simovici) -- 8. Algorithms for Data Streams (Camil Demetrescu and Irene Finocchi) -- 9. Applying Evolutionary Algorithms to Solve the Automatic Frequency Planning Problem (Francisco Luna, Enrique Alba, Antonio J. Nero, Patrick Nauru, and Salvador Pedraza) -- 10. Algorithmic Game Theory and Application s(Marios Mavronicolas, Vicky Papdopoulou, and Paul Spirakis) -- 11. Algorithms for Real-Time Object Detection in Images (Milos Stojmenovic) -- 12. 2D Shape Measures for Computer Vision (Paul L. Rosin and Jovisa Zunic) -- 13. Cryptographic Algorithms (Binal Roy and Amiya Nayak) -- 14. Secure Communication in Distributed Sensor Networks (DSN) (Subhamoy Maitra and Bimal Roy) -- 15. Localized Topology Control Algorithms for Ad Hoc and Sensor Networks (Hannes Frey and David Simplot-Ryl) -- 16. A Novel Admission Control for Multimedia LEO Satellite Networks (Syed R. Rizvi, Stephan Olariu, and Mona E. Rizvi) -- 17. Resilient Recursive Routing in Communication Networks (Costas C. Constantinou, Alexander S. Stepanenko, Theodoros N. Arvanitis, Kevin J. Baughan, and Bin Liu) -- 18. Routing Algorithms on WDM Optical Networks (Qian-Ping Gu) -- Index. | |
506 | 1 | _aRestricted to subscribers or individual electronic text purchasers. | |
520 | _aDiscover the benefits of applying algorithms to solve scientific, engineering, and practical problems Providing a combination of theory, algorithms, and simulations, Handbook of Applied Algorithms presents an all-encompassing treatment of applying algorithms and discrete mathematics to practical problems in "hot" application areas, such as computational biology, computational chemistry, wireless networks, and computer vision. In eighteen self-contained chapters, this timely book explores: * Localized algorithms that can be used in topology control for wireless ad-hoc or sensor networks * Bioinformatics algorithms for analyzing data * Clustering algorithms and identification of association rules in data mining * Applications of combinatorial algorithms and graph theory in chemistry and molecular biology * Optimizing the frequency planning of a GSM network using evolutionary algorithms * Algorithmic solutions and advances achieved through game theory Complete with exercises for readers to measure their comprehension of the material presented, Handbook of Applied Algorithms is a much-needed resource for researchers, practitioners, and students within computer science, life science, and engineering. Amiya Nayak, PhD, has over seventeen years of industrial experience and is Full Professor at the School of Information Technology and Engineering at the University of Ottawa, Canada. He is on the editorial board of several journals. Dr. Nayak's research interests are in the areas of fault tolerance, distributed systems/algorithms, and mobile ad-hoc networks. Ivan StojmenoviC?, PhD, is Professor at the University of Ottawa, Canada (www.site.uottawa.ca/~ivan), and Chair Professor of Applied Computing at the University of Birmingham, United Kingdom. Dr. Stojmenovic? received the Royal Society Wolfson Research Merit Award. His current research interests are mostly in the design and analysis of algorithms for wireless ad-hoc and sensor networks. | ||
530 | _aAlso available in print. | ||
538 | _aMode of access: World Wide Web. | ||
588 | _aDescription based on PDF viewed 12/19/2015. | ||
650 | 0 |
_aComputer algorithms. _94534 |
|
655 | 0 |
_aElectronic books. _93294 |
|
695 | _aAd hoc networks | ||
695 | _aAdvertising | ||
695 | _aAlgorithm design and analysis | ||
695 | _aArea measurement | ||
695 | _aArrays | ||
695 | _aAspirin | ||
695 | _aAssociation rules | ||
695 | _aAuthentication | ||
695 | _aAutomata | ||
695 | _aAutomatic frequency control | ||
695 | _aBandwidth | ||
695 | _aBase stations | ||
695 | _aBiological system modeling | ||
695 | _aBroadcasting | ||
695 | _aBuildings | ||
695 | _aCarbon | ||
695 | _aChapters | ||
695 | _aChemicals | ||
695 | _aClustering algorithms | ||
695 | _aCommunication networks | ||
695 | _aCommunication system security | ||
695 | _aComputational geometry | ||
695 | _aComputational modeling | ||
695 | _aComputer science | ||
695 | _aComputer vision | ||
695 | _aComputers | ||
695 | _aCorrelation | ||
695 | _aDNA | ||
695 | _aDairy products | ||
695 | _aData mining | ||
695 | _aData models | ||
695 | _aDatabases | ||
695 | _aDelay | ||
695 | _aEncryption | ||
695 | _aExtraterrestrial measurements | ||
695 | _aFace | ||
695 | _aGSM | ||
695 | _aGames | ||
695 | _aGene expression | ||
695 | _aGenerators | ||
695 | _aGraph theory | ||
695 | _aHeuristic algorithms | ||
695 | _aHistograms | ||
695 | _aHydrocarbons | ||
695 | _aIP networks | ||
695 | _aImage processing | ||
695 | _aIndexes | ||
695 | _aIterative algorithm | ||
695 | _aLow earth orbit satellites | ||
695 | _aMachine learning | ||
695 | _aMathematical model | ||
695 | _aMedia | ||
695 | _aMobile communication | ||
695 | _aMobile computing | ||
695 | _aMonitoring | ||
695 | _aMultimedia communication | ||
695 | _aNash equilibrium | ||
695 | _aNetwork topology | ||
695 | _aOptical fiber networks | ||
695 | _aOptical switches | ||
695 | _aPartitioning algorithms | ||
695 | _aPlanning | ||
695 | _aPricing | ||
695 | _aProbability distribution | ||
695 | _aProbes | ||
695 | _aProgram processors | ||
695 | _aProteins | ||
695 | _aProtocols | ||
695 | _aPublic key cryptography | ||
695 | _aQuality of service | ||
695 | _aRNA | ||
695 | _aRandom sequences | ||
695 | _aReal time systems | ||
695 | _aRegisters | ||
695 | _aResistance | ||
695 | _aRobot sensing systems | ||
695 | _aRouting | ||
695 | _aRouting protocols | ||
695 | _aSatellites | ||
695 | _aSearch problems | ||
695 | _aSections | ||
695 | _aSecurity | ||
695 | _aSensitivity | ||
695 | _aShape | ||
695 | _aShape measurement | ||
695 | _aSkeleton | ||
695 | _aSoftware algorithms | ||
695 | _aStrontium | ||
695 | _aSupport vector machines | ||
695 | _aTopology | ||
695 | _aTraining | ||
695 | _aWDM networks | ||
695 | _aWireless communication | ||
695 | _aWireless sensor networks | ||
700 | 1 |
_aStojmenovi�c, Ivan. _926109 |
|
700 | 1 |
_aNayak, Amiya. _926110 |
|
710 | 2 |
_aIEEE Xplore (Online Service), _edistributor. _926111 |
|
710 | 2 |
_aJohn Wiley & Sons _epublisher. _96902 |
|
776 | 0 | 8 |
_iPrint version: _z9780470044926 |
856 | 4 | 2 |
_3Abstract with links to resource _uhttps://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=5201533 |
942 | _cEBK | ||
999 |
_c73684 _d73684 |