Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Frontiers in Algorithmics [[electronic resource] ] : Second International Workshop, FAW 2008, Changsha, China, June 19-21, 2008, Proceedings / / edited by Franco P. Preparata, Xiaodong Wu, Jianping Yin
| Frontiers in Algorithmics [[electronic resource] ] : Second International Workshop, FAW 2008, Changsha, China, June 19-21, 2008, Proceedings / / edited by Franco P. Preparata, Xiaodong Wu, Jianping Yin |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XI, 350 p.) |
| Disciplina | 005.11 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Algorithms Computer science—Mathematics Discrete mathematics Numerical analysis Computer graphics Bioinformatics Programming Techniques Discrete Mathematics in Computer Science Numerical Analysis Computer Graphics Computational and Systems Biology |
| ISBN | 3-540-69311-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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 -- A Practical Parameterized Algorithm for Weighted Minimum Letter Flips Model of the Individual Haplotyping Problem -- SlopeMiner: An Improved Method for Mining Subtle Signals in Time Course Microarray Data -- A PTAS for the k-Consensus Structures Problem Under Euclidean Squared Distance -- Haplotype Assembly from Weighted SNP Fragments and Related Genotype Information -- Estimating Hybrid Frequency Moments of Data Streams -- Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations -- NP-Completeness of (k-SAT,r-UNk-SAT) and (LSAT???k ,r-UNLSAT???k ) -- Absorbing Random Walks and the NAE2SAT Problem -- Versioning Tree Structures by Path-Merging -- A Linear In-situ Algorithm for the Power of Cyclic Permutation -- Multi-bidding Strategy in Sponsored Keyword Auction -- A CSP-Based Approach for Solving Parity Game -- Characterizing and Computing Minimal Cograph Completions -- Efficient First-Order Model-Checking Using Short Labels -- Matching for Graphs of Bounded Degree -- Searching Trees with Sources and Targets -- Ranking of Closeness Centrality for Large-Scale Social Networks -- Mixed Search Number of Permutation Graphs -- The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs -- A Distributed Algorithm to Approximate Node-Weighted Minimum ?-Connected (?,k)-Coverage in Dense Sensor Networks -- Optimal Surface Flattening -- Visiting a Polygon on the Optimal Way to a Query Point -- Constraint Abstraction in Verification of Security Protocols -- Fast Convergence of Variable-Structure Congestion Control Protocol with Explicit Precise Feedback -- Applying a New Grid-Based Elitist-Reserving Strategy to EMO Archive Algorithms -- The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants -- Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach -- A Scalable Algorithm for Graph-Based Active Learning -- A Supervised Feature Extraction Algorithm for Multi-class -- An Incremental Feature Learning Algorithm Based on Least Square Support Vector Machine -- A Novel Wavelet Image Fusion Algorithm Based on Chaotic Neural Network. |
| Record Nr. | UNISA-996465300403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Frontiers in algorithmics : second international workshop, FAW 2008, Changsha, China, June 19-21, 2008, proceedings / / Franco P. Preparata, Xiaodong Wu, Jianping Yin (eds.)
| Frontiers in algorithmics : second international workshop, FAW 2008, Changsha, China, June 19-21, 2008, proceedings / / Franco P. Preparata, Xiaodong Wu, Jianping Yin (eds.) |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2008 |
| Descrizione fisica | 1 online resource (XI, 350 p.) |
| Disciplina | 005.11 |
| Altri autori (Persone) |
PreparataFranco P
WuXiaodong YinJianping |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico | Computer algorithms |
| ISBN | 3-540-69311-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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 -- A Practical Parameterized Algorithm for Weighted Minimum Letter Flips Model of the Individual Haplotyping Problem -- SlopeMiner: An Improved Method for Mining Subtle Signals in Time Course Microarray Data -- A PTAS for the k-Consensus Structures Problem Under Euclidean Squared Distance -- Haplotype Assembly from Weighted SNP Fragments and Related Genotype Information -- Estimating Hybrid Frequency Moments of Data Streams -- Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations -- NP-Completeness of (k-SAT,r-UNk-SAT) and (LSAT???k ,r-UNLSAT???k ) -- Absorbing Random Walks and the NAE2SAT Problem -- Versioning Tree Structures by Path-Merging -- A Linear In-situ Algorithm for the Power of Cyclic Permutation -- Multi-bidding Strategy in Sponsored Keyword Auction -- A CSP-Based Approach for Solving Parity Game -- Characterizing and Computing Minimal Cograph Completions -- Efficient First-Order Model-Checking Using Short Labels -- Matching for Graphs of Bounded Degree -- Searching Trees with Sources and Targets -- Ranking of Closeness Centrality for Large-Scale Social Networks -- Mixed Search Number of Permutation Graphs -- The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs -- A Distributed Algorithm to Approximate Node-Weighted Minimum ?-Connected (?,k)-Coverage in Dense Sensor Networks -- Optimal Surface Flattening -- Visiting a Polygon on the Optimal Way to a Query Point -- Constraint Abstraction in Verification of Security Protocols -- Fast Convergence of Variable-Structure Congestion Control Protocol with Explicit Precise Feedback -- Applying a New Grid-Based Elitist-Reserving Strategy to EMO Archive Algorithms -- The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants -- Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach -- A Scalable Algorithm for Graph-Based Active Learning -- A Supervised Feature Extraction Algorithm for Multi-class -- An Incremental Feature Learning Algorithm Based on Least Square Support Vector Machine -- A Novel Wavelet Image Fusion Algorithm Based on Chaotic Neural Network. |
| Altri titoli varianti | FAW 2008 |
| Record Nr. | UNINA-9910484196103321 |
| Berlin, : Springer, 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Modeling Decision for Artificial Intelligence [[electronic resource] ] : 8th International Conference, MDAI 2011, Changsha, Hunan, China, July 28-30, 2011, Proceedings / / edited by Vicenc Torra, Yasuo Narukawa, Jianping Yin, Jun Long
| Modeling Decision for Artificial Intelligence [[electronic resource] ] : 8th International Conference, MDAI 2011, Changsha, Hunan, China, July 28-30, 2011, Proceedings / / edited by Vicenc Torra, Yasuo Narukawa, Jianping Yin, Jun Long |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (XIII, 259 p.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Application software Data mining Database management Computer communication systems Algorithms Artificial Intelligence Information Systems Applications (incl. Internet) Data Mining and Knowledge Discovery Database Management Computer Communication Networks Algorithm Analysis and Problem Complexity |
| ISBN | 3-642-22589-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465750303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||