↓ Skip to main content

Frontiers in Algorithmics

Overview of attention for book
Frontiers in Algorithmics
Springer Berlin Heidelberg

Table of Contents

  1. Book Overview
  2. Chapter 1 Fixed Point Computation and Equilibrium
  3. Chapter 2 Computer Science in the Information Age
  4. Chapter 3 Knowledge-Based Approaches to Quantitative Medical Image Analysis and Image-Based Decision Making
  5. Chapter 4 Optimal Field Splitting, with Applications in Intensity-Modulated Radiation Therapy
  6. Chapter 5 A Practical Parameterized Algorithm for Weighted Minimum Letter Flips Model of the Individual Haplotyping Problem
  7. Chapter 6 SlopeMiner: An Improved Method for Mining Subtle Signals in Time Course Microarray Data
  8. Chapter 7 A PTAS for the k -Consensus Structures Problem Under Euclidean Squared Distance
  9. Chapter 8 Haplotype Assembly from Weighted SNP Fragments and Related Genotype Information
  10. Chapter 9 Estimating Hybrid Frequency Moments of Data Streams
  11. Chapter 10 Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations
  12. Chapter 11 NP-Completeness of (k-SAT, r -UNk-SAT) and (LSAT  ≥  k , r -UNLSAT  ≥  k )
  13. Chapter 12 Absorbing Random Walks and the NAE2SAT Problem
  14. Chapter 13 Versioning Tree Structures by Path-Merging
  15. Chapter 14 A Linear In-situ Algorithm for the Power of Cyclic Permutation
  16. Chapter 15 Multi-bidding Strategy in Sponsored Keyword Auction
  17. Chapter 16 A CSP-Based Approach for Solving Parity Game
  18. Chapter 17 Characterizing and Computing Minimal Cograph Completions
  19. Chapter 18 Efficient First-Order Model-Checking Using Short Labels
  20. Chapter 19 Matching for Graphs of Bounded Degree
  21. Chapter 20 Searching Trees with Sources and Targets
  22. Chapter 21 Ranking of Closeness Centrality for Large-Scale Social Networks
  23. Chapter 22 Mixed Search Number of Permutation Graphs
  24. Chapter 23 The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs
  25. Chapter 24 A Distributed Algorithm to Approximate Node-Weighted Minimum α -Connected ( θ , k )-Coverage in Dense Sensor Networks
  26. Chapter 25 Optimal Surface Flattening
  27. Chapter 26 Visiting a Polygon on the Optimal Way to a Query Point
  28. Chapter 27 Constraint Abstraction in Verification of Security Protocols
  29. Chapter 28 Fast Convergence of Variable-Structure Congestion Control Protocol with Explicit Precise Feedback
  30. Chapter 29 Applying a New Grid-Based Elitist-Reserving Strategy to EMO Archive Algorithms
  31. Chapter 30 The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants
  32. Chapter 31 Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach
  33. Chapter 32 A Scalable Algorithm for Graph-Based Active Learning
  34. Chapter 33 A Supervised Feature Extraction Algorithm for Multi-class
  35. Chapter 34 An Incremental Feature Learning Algorithm Based on Least Square Support Vector Machine
  36. Chapter 35 A Novel Wavelet Image Fusion Algorithm Based on Chaotic Neural Network
Overall attention for this book and its chapters

Mentioned by

patent
7 patents
wikipedia
3 Wikipedia pages
q&a
1 Q&A thread
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Article details
Title
Frontiers in Algorithmics
Published by
Springer Berlin Heidelberg, June 2008
DOI 10.1007/978-3-540-69311-6
ISBNs
978-3-54-069310-9, 978-3-54-069311-6
Editors

Preparata, Franco P., Wu, Xiaodong, Yin, Jianping

Login to access the Attention Digest and the Sentiment Analysis related to this output.

Timeline Attention over time Attention Score history
Login to access the full charts related to this output.