Combinatorics, Algorithms, Probabilistic and Experimental Methodologies: First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected PapersThe First International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies was held in Hangzhou, China, in April 2007. The symposium provided an interdisciplinary forum for researchers to share their discoveries and approaches; search for ideas, methodologies, and tool boxes; find better, faster, and more accurate solutions; and develop a research agenda of common interest. This volume constitutes the refereed post-proceedings of the symposium. Inside you'll find 46 full papers. They represent some of the most important thinking and advancements in the field. The papers address large data processing problems using different methodologies from major disciplines such as computer science, combinatorics, and statistics. |
No grāmatas satura
1.5. rezultāts no 5.
20. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
194. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
284. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
291. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
475. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
Lietotāju komentāri - Rakstīt atsauksmi
Ierastajās vietās neesam atraduši nevienu atsauksmi.
Saturs
BinPacking Algorithm Is FFDI 119OPTI+69 | 1 |
Sequential Vector Packing | 12 |
A Tighter Analysis of Set Cover Greedy Algorithm for Test Set | 24 |
A More Effective Linear Kernelization for Cluster Editing | 36 |
A Deterministic Summary Structure for Update Data Streams | 48 |
An Effective Refinement Algorithm Based on Swarm Intelligence for Graph Bipartitioning | 60 |
On the Complexity and Approximation of the MinSum and MinMax Disjoint Paths Problems | 70 |
A Digital Watermarking Scheme Based on Singular Value Decomposition | 82 |
Fast Matching Method for DNA Sequences | 271 |
AllPairs Ancestor Problems in Weighted Dags | 282 |
Streaming Algorithms for Data in Motion | 294 |
A Scheduling Problem with One Producer and the Bargaining Counterpart with Two Producers | 305 |
PhraseBased Statistical Language Modeling from Bilingual Parallel Corpus | 317 |
Optimal Commodity Distribution for a Vehicle with Fixed Capacity Under Vendor Managed Inventory | 329 |
Times | 340 |
with Its Variants | 350 |
A Newt nThreshold Scheme Based on Difference Equations | 94 |
CliqueTransversal Sets in Cubic Graphs | 107 |
On the Lh kLabeling of Cocomparability Graphs | 116 |
An Approximation Algorithm for the General Mixed Packing and Covering Problem | 128 |
Extending the Hardness of RNA Secondary Structure Comparison | 140 |
On the OnLine Weighted kTaxi Problem | 152 |
Model Futility and Dynamic Boundaries with Application in Banking Default Risk Modeling | 163 |
On the Minimum RiskSum Path Problem | 175 |
Constrained Cycle Covers in Halin Graphs | 186 |
Optimal Semionline Algorithms for Scheduling with Machine Activation Cost | 198 |
A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection | 209 |
Online Coupon Consumption Problem | 219 |
Application of Copula and CopulaCVaR in the Multivariate Portfolio Optimization | 231 |
Online Capacitated Interval Coloring | 243 |
Energy Efficient Heuristic Scheduling Algorithms for Multimedia Service | 255 |
Call Control and Routing in SONET Rings | 260 |
Quantitative Analysis of Multihop Wireless Networks Using a Novel Paradigm | 362 |
Inverse MinMax Spanning Tree Problem Under the Weighted SumType Hamming Distance | 375 |
Robust Optimization Model for a Class of Uncertain Linear Programs | 384 |
An Efficient Algorithm for Solving the Container Loading Problem | 396 |
A Bijective Code forkTrees with Linear Time Encoding and Decoding | 408 |
MarketBased Service Selection Framework in Grid Computing | 421 |
Informative Gene Selection and Tumor Classification by Null Space LDA for Microarray Data | 435 |
Heuristic Search for 2D NMR Alignment to Support Metabolite Identification | 447 |
A New Succinct Representation of RMQInformation and Improvements in the Enhanced Suffix Array | 459 |
Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem | 471 |
Finding Pure Nash Equilibrium of Graphical Game Via Constraints Satisfaction Approach | 483 |
A New Load Balanced Routing Algorithm for Torus Networks | 495 |
Optimal Semionline Scheduling Algorithms on a Small Number of Machines | 504 |
Lower Bounds on Edge Searching | 516 |
| 528 | |
Citi izdevumi - Skatīt visu
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies ... Bo Chen,Mike Paterson,Guochuan Zhang Ierobežota priekšskatīšana - 2007 |
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies ... Bo Chen Ierobežota priekšskatīšana - 2007 |
Bieži izmantoti vārdi un frāzes
AGREP alignment ALL-PAIRS approximation algorithm assigned bandwidth Berlin Heidelberg 2007 bins Chen Cluster coloring competitive ratio consider constraint contains copula cost cost(A critical clique cubic graph CVaR dags defined definition denote different distribution edge encoded Equation find first follows forall function gene selection graph G greedy algorithm Heidelberg IEEE integer interval graphs k-tree labeled Lemma linear LNCS lower bound machine method min-max Min-Sum minimize minimum risk-sum path Nash equilibrium nodes NP-complete NP-hard null space obtain on-line optimal solution packing pair parameter phase pmax polynomial processor Proof rejection risk-sum path problem routing scheduling scheme sequence shortest shortest path problem solved Springer Springer-Verlag Berlin Heidelberg step structure subgraph subset Tabu Search taxi Theorem topological ordering tree variable vector vertex vertices watermarked image weighted Zhang Eds
Bibliogrāfiskā informācija
| Nosaukums | Combinatorics, Algorithms, Probabilistic and Experimental Methodologies: First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers LNCS sublibrary: Theoretical computer science and general issues Grāmatas Lecture Notes in Computer Science 4614. sējums. sējums Theoretical Computer Science and General Issues |
| Autors | Bo Chen |
| Redaktori | Bo Chen, Mike Paterson, Guochuan Zhang |
| Līdzstrādnieks | Michael S. Paterson |
| Izdevums: | ilustrēts |
| Izdevējs | Springer Science & Business Media, 2007 |
| ISBN | 3540744495, 9783540744498 |
| Apjoms | 530 lappuses |
| Eksportēt avotu | BiBTeX EndNote RefMan |