Frontiers in Algorithmics Second International Workshop, FAW 2008, Changsha, China, June 19-21, 2008, Proceedings
The Annual International Frontiers in Algorithmics Workshop is a focused - rum on current trends in research on algorithms, discrete structures, and their applications. It intends to bring together international experts at the research frontiers in those areas to exchange ideas and to present signi?...
Saved in:
| Main Authors | , , |
|---|---|
| Format | eBook |
| Language | English |
| Published |
Berlin, Heidelberg
Springer Berlin / Heidelberg
2008
Springer |
| Edition | 1 |
| Series | Lecture Notes in Computer Science |
| Subjects | |
| Online Access | Get full text |
| ISBN | 3540693106 9783540693109 |
Cover
| Abstract | The Annual International Frontiers in Algorithmics Workshop is a focused - rum on current trends in research on algorithms, discrete structures, and their applications. It intends to bring together international experts at the research frontiers in those areas to exchange ideas and to present signi?cant new results. The mission of the workshop is to stimulate the various ?elds for which al- rithmics can become a crucial enabler, and to strengthen the ties between the Eastern and Western algorithmics research communities. The Second Inter- tional Frontiers in Algorithmics Workshop (FAW 2008) took place in Changsha, China, June 19-21, 2008. In response to the Call for Papers, 80 papers were submitted from 15 co- tries and regions: Canada, China, France, Germany, Greece, Hong Kong, India, Iran, Japan, Mexico, Norway, Singapore, South Korea, Taiwan, and the USA. After a six-week period of careful reviewing and discussion, the Program C- mittee accepted 32 submissions for presentation at the conference. These papers were selected for nine special focus tracks in the areas of biomedical inform- ics, discrete structures, geometric information processing and communication, games and incentive analysis, graph algorithms, internet algorithms and pro- cols, parameterized algorithms, design and analysis of heuristics, approximate and online algorithms, and machine learning. The program of FAW 2008 also included three keynote talks by Xiaotie Deng, John E. Hopcroft, and Milan Sonka. |
|---|---|
| AbstractList | The Annual International Frontiers in Algorithmics Workshop is a focused - rum on current trends in research on algorithms, discrete structures, and their applications. It intends to bring together international experts at the research frontiers in those areas to exchange ideas and to present signi?cant new results. The mission of the workshop is to stimulate the various ?elds for which al- rithmics can become a crucial enabler, and to strengthen the ties between the Eastern and Western algorithmics research communities. The Second Inter- tional Frontiers in Algorithmics Workshop (FAW 2008) took place in Changsha, China, June 19-21, 2008. In response to the Call for Papers, 80 papers were submitted from 15 co- tries and regions: Canada, China, France, Germany, Greece, Hong Kong, India, Iran, Japan, Mexico, Norway, Singapore, South Korea, Taiwan, and the USA. After a six-week period of careful reviewing and discussion, the Program C- mittee accepted 32 submissions for presentation at the conference. These papers were selected for nine special focus tracks in the areas of biomedical inform- ics, discrete structures, geometric information processing and communication, games and incentive analysis, graph algorithms, internet algorithms and pro- cols, parameterized algorithms, design and analysis of heuristics, approximate and online algorithms, and machine learning. The program of FAW 2008 also included three keynote talks by Xiaotie Deng, John E. Hopcroft, and Milan Sonka. |
| Author | Wu, Xiaodong Yin, Jianping Preparata, Franco P |
| Author_xml | – sequence: 1 fullname: Preparata, Franco P – sequence: 2 fullname: Wu, Xiaodong – sequence: 3 fullname: Yin, Jianping |
| BookMark | eNpVjz1PwzAYhI34EG3JD2Drhhgi2X79EY8lagGpEgtijWznNQ0NMcQG_j4RhYFbTic9utPNyckQBzwihdEVSEGVAcbUMZn_BarOyIwLVZlKGX5OipRe6CRguqJyRi43Yxxyh2NadsNy1T_Hscu7186nC3IabJ-w-PUFedqsH-u7cvtwe1-vtqUFLUCUEplSvp32neLWOGsd1UH4ILT0EjmGMCXJWs2M99gCegjBcATHTHACFuT6UGzTHr_SLvY5NZ89uhj3qfl3bGKvDuzbGN8_MOXmB_M45NH2zfqmBqoqaQC-AaCrTeI |
| ContentType | eBook |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 9783540693116 3540693114 |
| Edition | 1 2008 edition. |
| ExternalDocumentID | 9783540693116 EBC3068593 |
| GroupedDBID | 089 0D6 0DA 2HV 38. A4J AABBV AABFA AAFYB AAUKK ABBVZ ABGTP ABMNI ACANT ACHXG ACKTP AEDXK AEJLV AEKFX AETDV AEZAY ALMA_UNASSIGNED_HOLDINGS AZZ BBABE CZZ IEZ IW- JJU MA. MMI MW~ NUU SBO SVJCK TPJZQ TSXQS Z83 Z84 Z88 -7M -7Q -BG LDH NUC SAO Z7R Z7X Z8R Z8W Z92 |
| ID | FETCH-LOGICAL-a37434-5e166cd783b62a9baab07f4cf475c5e2efff4c51d719cced3ec3ff92e3b19fb43 |
| ISBN | 3540693106 9783540693109 |
| IngestDate | Fri Nov 08 04:04:17 EST 2024 Fri May 30 21:52:30 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| LCCallNum_Ident | QA76.6-76.66 |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-a37434-5e166cd783b62a9baab07f4cf475c5e2efff4c51d719cced3ec3ff92e3b19fb43 |
| OCLC | 246898692 |
| PQID | EBC3068593 |
| PageCount | 359 |
| ParticipantIDs | askewsholts_vlebooks_9783540693116 proquest_ebookcentral_EBC3068593 |
| PublicationCentury | 2000 |
| PublicationDate | 2008 2008-06-07 |
| PublicationDateYYYYMMDD | 2008-01-01 2008-06-07 |
| PublicationDate_xml | – year: 2008 text: 2008 |
| PublicationDecade | 2000 |
| PublicationPlace | Berlin, Heidelberg |
| PublicationPlace_xml | – name: Berlin, Heidelberg |
| PublicationSeriesTitle | Lecture Notes in Computer Science |
| PublicationYear | 2008 |
| Publisher | Springer Berlin / Heidelberg Springer |
| Publisher_xml | – name: Springer Berlin / Heidelberg – name: Springer |
| SSID | ssj0000317805 |
| Score | 1.8170382 |
| Snippet | The Annual International Frontiers in Algorithmics Workshop is a focused - rum on current trends in research on algorithms, discrete structures, and their... |
| SourceID | askewsholts proquest |
| SourceType | Aggregation Database Publisher |
| SubjectTerms | Computer algorithms Congresses |
| Subtitle | Second International Workshop, FAW 2008, Changsha, China, June 19-21, 2008, Proceedings |
| TableOfContents | Basic Ranking Algorithm -- Improving the Algorithm with a Heuristic -- Conclusion and Discussions -- Mixed Search Number of Permutation Graphs -- Introduction -- Preliminaries -- Chordal Graphs, Interval Graphs, and Pathwidth -- Search Games -- Mixed Search Number of Permutation Graphs -- Edge Search Number of Complete Bipartite Graphs -- Concluding Remarks -- The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs -- Introduction -- Theoretical Framework -- The Algorithm -- Correctness and Time Complexity -- A Distributed Algorithm to Approximate Node-Weighted Minimum α-Connected (θ,k)-Coverage in Dense Sensor Networks -- Introduction -- Related Work -- The Node-Weighted (α,θ, k )-CCS Problem and Our Approach -- Distributed Algorithm for Node-Weighted (α,θ, k )-CCS -- Simulation -- Conclusion -- References -- Optimal Surface Flattening -- Introduction -- The NP-Hardness of the Optimal Surface Flattening Problem -- A (1+\epsilon)-Approximation SF Algorithm -- References -- Visiting a Polygon on the Optimal Way to a Query Point -- Introduction -- The Reflective Subdivision -- Polygonal Domains -- Conclusion -- Constraint Abstraction in Verification of Security Protocols -- Introduction -- Protocol Model -- Protocol Preliminaries -- Horn Logic Syntax -- The Model for the Attacker -- The Model of the Honest Roles -- Resolution -- Constraint Abstraction -- Verification of WMF Protocol in Abstracted Horn Model -- Conclusion -- Fast Convergence of Variable-Structure Congestion Control Protocol with Explicit Precise Feedback -- Introduction -- Variable-Structure Congestion Control Protocol (VCP) -- VCP Fast Convergence (VCP-FC) -- Convergence to Efficiency -- Convergence to Fairness -- Simulations and Results -- Conclusion -- Applying a New Grid-Based Elitist-ReservingStrategy to EMO Archive Algorithms -- Introduction Conclusions Title Page -- Preface -- Organization -- Table of Contents -- Fixed Point Computation and Equilibrium -- Computer Science in the Information Age -- Knowledge-Based Approaches to Quantitative Medical Image Analysis and Image-Based Decision Making -- Optimal Field Splitting, with Applications in Intensity-Modulated Radiation Therapy -- Introduction -- Constrained Field Splitting with Overlapping (CFSO) -- Notation and Definitions -- The General Row Splitting (GRS) Problem -- The Constrained Field Splitting with Fixed Overlapping (CFSFO) Problem -- The Constrained Field Splitting with Overlapping (CFSO) Problem -- Implementation and Experiments -- A Practical Parameterized Algorithm for Weighted Minimum Letter Flips Model of the Individual Haplotyping Problem -- Introduction -- Individual Haplotyping Problem -- A Parameterized Algorithm for WMLF -- Experimental Results -- Conclusion -- SlopeMiner: An Improved Method for Mining Subtle Signals in Time Course Microarray Data -- Introduction -- Method -- Results -- Conclusions -- References -- A PTAS for the k-Consensus Structures Problem Under Euclidean Squared Distance -- Introduction -- Preliminaries -- PTAS for the k-Consensus Structural Fragments -- Discretized Rotation Space -- A Polynomial Time Algorithm with Cost ((1+\epsilon)D_{opt}+c) -- A Polynomial Time 4 Approximation Algorithm -- A (1+\epsilon) Polynomial Time Approximation Scheme -- Discussions -- Haplotype Assembly from Weighted SNP Fragments and Related Genotype Information -- Introduction -- Formulation and Problem Definition -- A Heuristic Method Based on a Genetic Algorithm -- The Hypothesis Space -- Construction of the Initial Population Under the Guidance of Genotype Information -- Haplotype Assembly Rule from a Partition -- Designation of the Fitness Function -- Genetic Operators -- Analysis of the Experimental Results Experiment on Data from Chromosome 5q31 -- Conclusion -- Estimating Hybrid Frequency Moments of Data Streams -- Introduction -- Preliminaries -- Estimating Hybrid Frequency Moments F_{p,q, p,q} [0,2] -- Bi-linear Stable Sketches -- Analysis of Bi-linear Stable Sketches -- Proofs -- {\sc Constraint Bipartite Vertex Cover} Simpler Exact Algorithms and Implementations -- Introduction -- Algorithm Variants -- The Simplest Algorithm A1 -- Triviality Last: Algorithm A2 -- More Sophistication: Algorithm A3 -- The Tests -- Conclusions: Lessons Learned and Future Work -- NP-Completeness of (k-SAT,r-UNk-SAT) and (LSAT_{≥k},r-UNLSAT_{≥k}) -- Introduction -- Preliminaries -- NP-Completeness of (k-SAT,r-UNk-SAT) and (LSAT,r-UNLSAT) -- NP-Completeness of (LSAT_{\geq4},r-UNLSAT_{\geq4}) -- Conclusions and Future Works -- Absorbing Random Walks and the NAE2SAT Problem -- Introduction -- Preliminaries -- Assignment Verification for NAE2SAT -- Complexity Classes -- Markov Chains and Random Walks -- The Convergence Numbers -- Algorithm and Analysis -- Analysis -- Graph Bipartiteness -- Analysis -- Conclusion -- Versioning Tree Structures by Path-Merging -- Introduction -- Implications of Access Operations in Partially Persistent Structures -- Planar Point Location -- Range Query of Horizontal Line-Segments -- Essential and Non-essential Versions -- Merging Non-essential Versions in Partially Persistent BSTs -- Path-Merging Via Path-Copying -- Path-Merging Via Node-Copying -- Analysis of the Path-Merging Technique -- Conclusion -- A Linear In-situ Algorithm for the Power of Cyclic Permutation -- Introduction -- Preliminaries -- Notations about Permutations -- A Brief Description of PAR^[10 - 14]} -- Computing Pr with P^r Represented by Twin Ring T -- Implementation of Twin Ring Based on PAR Platform Derive a Algorithmic Program to Implement rotL(T:TwinRing -- r:Integer) -- Derive a Algorithmic Program to Implement rotR(T:TwinRing -- r:Integer) -- Compare with Related Works -- Concluding Remarks -- References -- Multi-bidding Strategy in Sponsored Keyword Auction -- Introduction -- Related Work -- Our Contributions -- Model and Notation -- Multi-bidding Model -- The Existence of Nash Equilibrium -- Preliminaries -- Simple Setting -- Existence of Pure Nash Equilibria -- Non-existence of Nash Equilibria -- Only One Bidder Multi-bidding -- An Impossibility Result -- Multiple Biddings of Players with Multiple Private Values -- A CSP-Based Approach for Solving Parity Game -- Introduction -- Previous Works -- Preliminaries -- Parity Game -- Constraint Satisfaction Problem (CSP) -- Translate Parity Game to CSP -- Character of Winning Strategy -- Encoding Parity Game to CSP -- An CSP-Based Algorithm -- The Algorithm -- Correctness of the Algorithm -- Experimental Results -- Conclusion and Future Work -- Characterizing and Computing Minimal Cograph Completions -- Introduction -- Preliminaries -- Characterizing Minimal Cograph Completions -- Computing a Minimal Cograph Completion Directly -- Adding a Vertex to a Cograph -- Implementing Algorithm MxCC Using a Cotree Representation -- Concluding Remarks -- Efficient First-Order Model-Checking Using Short Labels -- Introduction -- Notations and Definitions -- Graphs -- Locally Decomposable Classes -- Results -- Matching for Graphs of Bounded Degree -- Introduction -- The Bound -- Searching Trees with Sources and Targets -- Introduction -- Searching Trees with Sources -- Searching Trees with Targets -- Searching Trees with Sources and Targets -- Conclusion and Future Work -- Ranking of Closeness Centrality for Large-Scale Social Networks -- Introduction -- Preliminary -- Ranking Algorithms Basic Concepts -- Grid-Measure and ε-MOEA -- Generality of Grid-Measure -- The ε-Dominance Concept -- ε-MOEA and Its Shortage -- New Elitist-Reserving Strategy and δ-MOEA -- The δ-Dominance Concept -- The δ-Dominance Based Elitist-Reserving Strategy -- The Framework of δ-MOEA -- Numerical Experiments and Discussion -- Test Functions and Parameter Settings -- Performance Metrics -- Results and Discussion -- Conclusions -- References -- The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants -- Introduction -- Preliminaries -- AW[1]-Hardness Proof for d-Dimensional Rectangle Stabbing with d \geq 3 -- FPT Algorithms for Restrictions of 2-Dimensional Rectangle Stabbing -- Case 1: Rectangles Have Bounded Height -- Case 2: Rectangles Have Bounded Width or Height -- Case 3: Bounded Intersection -- Open Questions -- Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach -- Introduction -- Contributions -- Notation and Conventions -- Motivation -- Branch and Prune -- Heuristic Search Strategy -- The New Algorithm -- Performance Analysis -- Worst-Case Complexity -- Average-Case Complexity -- Comparison of Related Works -- Conclusions and Future Work -- A Scalable Algorithm for Graph-Based Active Learning -- Introduction -- Preliminary -- Basic Notation -- The Graph-Based Active Learning method -- Learning Engine in GAL -- Sampling Engine in GAL -- The Process of Graph-Based Active Learning -- The Scalable Graph-Based Active Learning method -- Backbone Graph Construction -- Two-Stage Active Learning -- Efficiency Improving -- Experiment -- Methodology -- Datasets -- Metrics -- Results -- Conclusion -- A Supervised Feature Extraction Algorithm for Multi-class -- Introduction -- Feature Extraction Algorithm -- Symmetry Cross Entropy -- Feature Extraction Algorithm -- Experimental Results |
| Title | Frontiers in Algorithmics |
| URI | https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=3068593 https://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9783540693116 |
| Volume | 5059 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NT9swFLcGaBJcxmBoMEDWxI1maj5dI3EAVIQQQ0h89VbZjl3QIEFN4LC_fu-5dpoCh22XKHYsR_Yv8ft-j5AdJgwXmRFBngoQUGLRC3pK6iCJNFD0MO9KhRbdn-fZyXVyOkgH08KJNrqklj_U73fjSv4HVegDXDFK9h-QbSaFDrgHfOEKCMP1FfPbNF3NIUw7gEWsrbriYVSCiH_3iD4_IOBfooybv9L1oVK8uittNbrjg1vMJNhz5vZi5Kw-tpb2JFQDWM-QB1GILT_0oqF1DR9-MdY2d7jwPLAqpwFjt8_YO7gXIPk6-ojHiyv_BZ_lkyebuFm62j9z9ozzsrZuYru-5IQ_gWZUFD3rSsXeqChnRFfUN2Uc85K2z2Lgx_iUMjX-gq3xYTZH5hgDOXvhoH96dtMo1OB0wvoMLn7HTp19bFRbk1ctkSVR_QLqAZSlrt6QX8tTXC2TBY2BJp_JB12skE9-rdStdZWMG5TpfUHbKO_RCcZ0BmPqMe5QQJjiFnWoxxfvAN0ORWypxbbjhrRw_UJujvtXRyeBK5ERiBh4vyRIdZhlKodFyiwSXAohu8wkyiQsVamOtDHQSsOchVwpncdaxcbwSMcy5EYm8RqZL8pCfyXUiDgSCVOSdQ0wyblIQTSQHDhE_M2lWSffW5s3fHmw5vxqOAPOOqF-T4f2ufMxHvYPj0A6xex6G38zzzeyOP2SNsl8PX7WW8D-1XLbAf8HnnZY2g |
| linkProvider | Library Specific Holdings |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Frontiers+in+Algorithmics%3A+Second+International+Workshop%2C+FAW+2008%2C+Changsha%2C+China%2C+June+19-21%2C+2008%2C+Proceedings&rft.au=Preparata%2C+Franco+P&rft.au=Wu%2C+Xiaodong&rft.au=Yin%2C+Jianping&rft.series=Lecture+Notes+in+Computer+Science&rft.date=2008-06-07&rft.pub=Springer&rft.isbn=9783540693109&rft.volume=5059&rft.externalDocID=9783540693116 |
| thumbnail_m | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fvle.dmmserver.com%2Fmedia%2F640%2F97835406%2F9783540693116.jpg |