標(biāo)題: Titlebook: Computing and Combinatorics; 13th Annual Internat Guohui Lin Conference proceedings 2007 Springer-Verlag Berlin Heidelberg 2007 Alignment.B [打印本頁(yè)] 作者: Detrusor-Muscle 時(shí)間: 2025-3-21 18:55
書目名稱Computing and Combinatorics影響因子(影響力)
書目名稱Computing and Combinatorics影響因子(影響力)學(xué)科排名
書目名稱Computing and Combinatorics網(wǎng)絡(luò)公開度
書目名稱Computing and Combinatorics網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Computing and Combinatorics被引頻次
書目名稱Computing and Combinatorics被引頻次學(xué)科排名
書目名稱Computing and Combinatorics年度引用
書目名稱Computing and Combinatorics年度引用學(xué)科排名
書目名稱Computing and Combinatorics讀者反饋
書目名稱Computing and Combinatorics讀者反饋學(xué)科排名
作者: COWER 時(shí)間: 2025-3-21 22:37
Definition of an Ideal Comparative Processe complex biological phenomena than previous formulations. These ILP formulations solve efficiently on data whose composition reflects a range of data of current biological interest. We also assess the biological quality of the ILP solutions: some of the problems, although not all, solve with excell作者: 漂浮 時(shí)間: 2025-3-22 04:13 作者: 招致 時(shí)間: 2025-3-22 05:14 作者: admission 時(shí)間: 2025-3-22 10:23
0302-9743 , the UK, the USA, and the US minor outlying islands. Afterasixweekperiodofcarefulreviewinganddiscussions,theprogramc- mittee accepted 51 submissions for oral p978-3-540-73544-1978-3-540-73545-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Irascible 時(shí)間: 2025-3-22 13:30
Online Frequency Assignment in Wireless Communication Networks,the available spectrum to the call without causing any interference with other calls. Interference may occur, which distorts the radio signals, when the same frequency is assigned to two different calls emanating from cells that are geographically close to each other. Thus the FAP problem can be vie作者: Irascible 時(shí)間: 2025-3-22 19:39
Integer Programming Formulations and Computations Solving Phylogenetic and Population Genetic Proble complex biological phenomena than previous formulations. These ILP formulations solve efficiently on data whose composition reflects a range of data of current biological interest. We also assess the biological quality of the ILP solutions: some of the problems, although not all, solve with excell作者: Indebted 時(shí)間: 2025-3-22 23:41
Connected Coloring Completion for General Graphs: Algorithms and Complexity,-CCC problem, parameterized (only) by the treewidth . of the graph, is fixed-parameter tractable; we show this by a method that is of independent interest. The .-CCC problem is shown to be .[1]-hard, when parameterized by the treewidth bound ., for any .?≥?2. Our proof also shows that the problem is作者: Functional 時(shí)間: 2025-3-23 02:25 作者: 最有利 時(shí)間: 2025-3-23 05:38
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/234781.jpg作者: 顛簸下上 時(shí)間: 2025-3-23 11:08 作者: Hyperlipidemia 時(shí)間: 2025-3-23 14:14
Design Criteria for Rocket Enginesidea: either a graph has nice (from the algorithmic point of view) properties which allow a simple recursive procedure to find the solution fast, or the pathwidth of the graph is small, which in turn can be used to find the solution by dynamic programming. By making use of this technique we obtain the fastest known exact algorithms作者: CLAN 時(shí)間: 2025-3-23 18:54
Thermal Effects in Viscoplasticity,ach along with dynamic programming on graphs with bounded treewidth. To achieve . bound we introduce a technique of measuring running time of our algorithm by combining . approach with linear programming.作者: medieval 時(shí)間: 2025-3-24 00:50 作者: 具體 時(shí)間: 2025-3-24 04:42
An Improved Exact Algorithm for Cubic Graph TSP,It is shown that the traveling salesman problem for graphs of degree at most three with . vertices can be solved in time .(1.251.), improving the previous bound .(1.260.) by Eppstein.作者: Contend 時(shí)間: 2025-3-24 08:28
Improved Exact Algorithms for Counting 3- and 4-Colorings,idea: either a graph has nice (from the algorithmic point of view) properties which allow a simple recursive procedure to find the solution fast, or the pathwidth of the graph is small, which in turn can be used to find the solution by dynamic programming. By making use of this technique we obtain the fastest known exact algorithms作者: 割讓 時(shí)間: 2025-3-24 10:53
Counting Minimum Weighted Dominating Sets,ach along with dynamic programming on graphs with bounded treewidth. To achieve . bound we introduce a technique of measuring running time of our algorithm by combining . approach with linear programming.作者: 構(gòu)成 時(shí)間: 2025-3-24 18:18
Thermoelastic Models of Continua5 billion nucleotides long with an estimated 65-80team of university and private laboratory researchers under the auspices of NSF/USDA/DOE is working towards deciphering the majority of the sequence information including all genes, determining their order and orientation, and anchoring them to genet作者: orthodox 時(shí)間: 2025-3-24 19:44
Prestressed Thermoelastic Bodies,source and the Frequency Assignment Problem (FAP), aiming for better utilization of the frequencies, has been extensively studied in the past 20-30 years. Because of the rapid development of new wireless applications such as digital cellular network, cellular phone, the FAP problem has become more i作者: 的事物 時(shí)間: 2025-3-25 02:30
Thermoelastostatics of Micropolar Bodies,or example: two genomes, two music scores, two programs, two articles, two emails, or from a question to an answer? Furthermore, such a distance measure must be application-independent, must be universal in the sense it is provably better than all other distances, and must be applicable..From a simp作者: candle 時(shí)間: 2025-3-25 07:13 作者: GRIPE 時(shí)間: 2025-3-25 08:51 作者: 正面 時(shí)間: 2025-3-25 14:53
https://doi.org/10.1007/978-1-4757-6830-5a genomic database. As seed-based heuristics have been proved very efficient to accelerate the classical homology based search methods such as BLAST, we use a similar idea for RNA structures. We present an exclusion method for RNA search allowing for possible nucleotide insertion, deletion and subst作者: 斷斷續(xù)續(xù) 時(shí)間: 2025-3-25 17:19
Design Criteria for Rocket Engineses while tolerating as many quartet errors as possible. This is achieved by carefully selecting two possible neighbor leaves to merge and assigning weights intelligently to the quartets that contain newly merged leaves. Theoretically we prove that this method will always reconstruct the correct tree作者: 單獨(dú) 時(shí)間: 2025-3-25 20:09 作者: 痛得哭了 時(shí)間: 2025-3-26 01:39
Design Criteria for Rocket Enginesidea: either a graph has nice (from the algorithmic point of view) properties which allow a simple recursive procedure to find the solution fast, or the pathwidth of the graph is small, which in turn can be used to find the solution by dynamic programming. By making use of this technique we obtain t作者: Etymology 時(shí)間: 2025-3-26 05:26
Definition of an Ideal Comparative Processn well-studied for .?=?1, in the case of trees, under the rubric of ., used in modeling perfect phylogenies. Several applications in bioinformatics of connected coloring problems on general graphs are discussed, including analysis of protein-protein interaction networks and protein structure graphs,作者: Conjuction 時(shí)間: 2025-3-26 10:07 作者: AGONY 時(shí)間: 2025-3-26 13:18
Design Criteria for Rocket Enginesr matrix method we construct a family of graphs which have at least 2.4262. simple cycles and at least 2.0845. Hamilton cycles..Based on counting arguments for perfect matchings we prove that 2.3404. is an upper bound for the number of Hamiltonian cycles. Moreover, we obtain upper bounds for the num作者: 音樂會(huì) 時(shí)間: 2025-3-26 19:18 作者: Mettle 時(shí)間: 2025-3-27 00:19
Basic Principles of the Alternative Theoryorithm for enumerating all .-isolated cliques due to Ito et al.?[European Symposium on Algorithms 2005] and obtain an algorithm running in?.(4.·. .·|.|) time. We describe a speedup trick that also helps parallelizing the enumeration. Moreover, we introduce a more restricted and a more general isolat作者: 繁殖 時(shí)間: 2025-3-27 02:10 作者: 身體萌芽 時(shí)間: 2025-3-27 07:22
Thermal Effects in Viscoplasticity,ach along with dynamic programming on graphs with bounded treewidth. To achieve . bound we introduce a technique of measuring running time of our algorithm by combining . approach with linear programming.作者: Landlocked 時(shí)間: 2025-3-27 10:30
G. I. Barenblatt,V. M. Entov,R. L. Salganikve is to maximize the total weight of completed intervals. An optimal 4-competitive algorithm has long been known in the deterministic case, but the randomized case remains open. We give the first randomized algorithm for this problem, achieving a competitive ratio of 3.618. We also prove a randomiz作者: macabre 時(shí)間: 2025-3-27 17:39 作者: 流行 時(shí)間: 2025-3-27 21:13
978-3-540-73544-1Springer-Verlag Berlin Heidelberg 2007作者: 易于出錯(cuò) 時(shí)間: 2025-3-27 22:58 作者: 叢林 時(shí)間: 2025-3-28 04:11 作者: 暫時(shí)別動(dòng) 時(shí)間: 2025-3-28 06:57
Online Interval Scheduling: Randomized and Multiprocessor Cases,ude our new algorithm. We also show that the techniques can be carried to the deterministic multiprocessor case, giving a 3.618-competitive 2-processor algorithm, a 5/4 lower bound for any number of processors, and a 2 lower bound for 2 processors.作者: Metastasis 時(shí)間: 2025-3-28 12:38 作者: 系列 時(shí)間: 2025-3-28 15:54 作者: 避開 時(shí)間: 2025-3-28 19:41
On the Number of Cycles in Planar Graphs,ber of simple cycles of a given length with a face coloring technique. Combining both, we show that there is no planar graph with more than 2.8927. simple cycles. This reduces the previous gap between the upper and lower bound for the exponential growth from 1.03 to 0.46.作者: outer-ear 時(shí)間: 2025-3-29 01:12 作者: investigate 時(shí)間: 2025-3-29 04:41 作者: Cumulus 時(shí)間: 2025-3-29 08:10
Design Criteria for Rocket Engines-joining. Experiments on the real data set also shows the potential of this method. We also propose a simple technique to improve the quality of quartet set. Using this technique we can improve the results of our method.作者: 表否定 時(shí)間: 2025-3-29 11:54
Definition of an Ideal Comparative Processme, a problem kernel of size .(..) can be obtained, and (2)We prove that the problem can be solved in linear time for fixed .. The technique used to establish the second result appears to be of general interest and applicability for bounded treewidth problems.作者: 興奮過度 時(shí)間: 2025-3-29 16:31 作者: LEERY 時(shí)間: 2025-3-29 21:00 作者: 滑動(dòng) 時(shí)間: 2025-3-30 03:04
A New Quartet Approach for Reconstructing Phylogenetic Trees: Quartet Joining Method,-joining. Experiments on the real data set also shows the potential of this method. We also propose a simple technique to improve the quality of quartet set. Using this technique we can improve the results of our method.作者: Gingivitis 時(shí)間: 2025-3-30 05:20 作者: 諂媚于人 時(shí)間: 2025-3-30 11:35
Alignments with Non-overlapping Moves, Inversions and Tandem Duplications in ,(,,) Time, schemes. Furthermore, we show that the alignment problem extended to non-overlapping moves, inversions and tandem duplications can be solved with the same time complexities. Finally, an example of an alignment with non-overlapping moves is provided.作者: 混雜人 時(shí)間: 2025-3-30 15:11
0302-9743 ns of computing and combinatorics. It brings together researchers, professionals and industrial practitioners to interact and exchange knowledge, ideas and progress. Thetopics covermost aspects oftheoreticalcomputer scienceand combinatorics related to computing. The 13th Annual International Computi作者: 美食家 時(shí)間: 2025-3-30 17:52
Thermoelastic Models of Continuatowards deciphering the majority of the sequence information including all genes, determining their order and orientation, and anchoring them to genetic/physical maps. In this talk, I will present some of the combinatorial problems that arise in this context and outline the role of graph, string and parallel algorithms in solving them.作者: 硬化 時(shí)間: 2025-3-30 21:30
Thermoelastostatics of Micropolar Bodies,re must be application-independent, must be universal in the sense it is provably better than all other distances, and must be applicable..From a simple and accepted assumption in thermodynamics, we have developed such a theory. I will present this theory and will present one of the new applications of this theory: a question answering system.作者: 刺穿 時(shí)間: 2025-3-31 01:26
Classical Gas Dynamics of the ICPubsumes two previous results and the second item answers a question of Lutz and Mayordomo. Our proofs use Littlestone’s Winnow2 algorithm for learning .-of-. threshold functions and Maass and Turán’s algorithm for learning halfspaces.作者: motivate 時(shí)間: 2025-3-31 08:17
The Combinatorics of Sequencing the Corn Genome,towards deciphering the majority of the sequence information including all genes, determining their order and orientation, and anchoring them to genetic/physical maps. In this talk, I will present some of the combinatorial problems that arise in this context and outline the role of graph, string and parallel algorithms in solving them.作者: vibrant 時(shí)間: 2025-3-31 09:30 作者: HERTZ 時(shí)間: 2025-3-31 14:18
Dimension, Halfspaces, and the Density of Hard Sets,ubsumes two previous results and the second item answers a question of Lutz and Mayordomo. Our proofs use Littlestone’s Winnow2 algorithm for learning .-of-. threshold functions and Maass and Turán’s algorithm for learning halfspaces.作者: Vldl379 時(shí)間: 2025-3-31 19:14
Solid Mechanics and Its Applicationsg the total delivery error of the splitting. Our solution models the problem as a shortest path problem on a directed layered graph, which satisfies the staircase Monge property. Consequently, the resulting algorithm runs in almost linear time and generates an optimal quality field splitting.作者: MONY 時(shí)間: 2025-4-1 01:33
https://doi.org/10.1007/978-1-4757-6830-5itution. It is based on a partition of the RNA stem-loops into consecutive seeds and a preprocessing of the target database. This algorithm can be used to improve time efficiency of current methods, and is guaranteed to find all occurrences that contain at least one exact seed.作者: Aggregate 時(shí)間: 2025-4-1 04:27
Design Criteria for Rocket Enginesber of simple cycles of a given length with a face coloring technique. Combining both, we show that there is no planar graph with more than 2.8927. simple cycles. This reduces the previous gap between the upper and lower bound for the exponential growth from 1.03 to 0.46.作者: brassy 時(shí)間: 2025-4-1 06:14
Basic Principles of the Alternative Theoryion concept and show that both lead to faster enumeration algorithms. Finally, we extend our considerations to .-plexes (a relaxation of the clique notion), pointing out a W[1]-hardness result and providing a fixed-parameter algorithm for enumerating isolated .-plexes.作者: Harpoon 時(shí)間: 2025-4-1 13:13
The Combinatorics of Sequencing the Corn Genome,5 billion nucleotides long with an estimated 65-80team of university and private laboratory researchers under the auspices of NSF/USDA/DOE is working towards deciphering the majority of the sequence information including all genes, determining their order and orientation, and anchoring them to genet
