標(biāo)題: Titlebook: LATIN 2008: Theoretical Informatics; 8th Latin American S Eduardo Sany Laber,Claudson Bornstein,Luerbio Fari Conference proceedings 2008 Sp [打印本頁] 作者: Deflated 時(shí)間: 2025-3-21 16:44
書目名稱LATIN 2008: Theoretical Informatics影響因子(影響力)
作者: anchor 時(shí)間: 2025-3-21 23:33 作者: Exterior 時(shí)間: 2025-3-22 04:07
0302-9743 Overview: 978-3-540-78772-3978-3-540-78773-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: BYRE 時(shí)間: 2025-3-22 05:30 作者: chondromalacia 時(shí)間: 2025-3-22 12:06 作者: CAGE 時(shí)間: 2025-3-22 14:35 作者: Monolithic 時(shí)間: 2025-3-22 18:57 作者: 小教堂 時(shí)間: 2025-3-23 00:00 作者: 無辜 時(shí)間: 2025-3-23 01:34 作者: 向外 時(shí)間: 2025-3-23 09:16
On Dissemination Thresholds in Regular and Irregular Graph Classes,ed active. Initially active vertices are chosen independently with probability ., and at any stage in the process, a vertex becomes active if the majority of its neighbours are active, and thereafter never changes its state. We show that in any cubic graph, with high probability, the information wil作者: 合并 時(shí)間: 2025-3-23 11:01
How to Complete a Doubling Metric,esearch has not only enhanced our understanding of finite metrics, but has also resulted in many algorithmic applications. However, we still do not understand the interaction between various graph-theoretic (topological) properties of graphs, and the doubling (geometric) properties of the shortest-p作者: 外形 時(shí)間: 2025-3-23 15:33 作者: Factorable 時(shí)間: 2025-3-23 21:23 作者: 紳士 時(shí)間: 2025-3-23 22:23
Comparing and Aggregating Partially Resolved Trees,es are based on the topologies the input trees induce on .; that is, on three-element subsets of the set of species. For unrooted trees, the measures are based on . (four-element subsets). Triplet and quartet-based distances provide a robust and fine-grained measure of the similarities between trees作者: 繁忙 時(shí)間: 2025-3-24 04:57
Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices,c growth of the number . . of overlap-free words of length .. We obtain explicit formulas for the minimal and maximal rates of growth of . . in terms of spectral characteristics (the lower spectral radius and the joint spectral radius) of one set of matrices of dimension 20. Using these descriptions作者: Bumptious 時(shí)間: 2025-3-24 07:18 作者: Synchronism 時(shí)間: 2025-3-24 11:06 作者: BABY 時(shí)間: 2025-3-24 17:19
The View Selection Problem for Regular Path Queries,sense. In this paper we study the view selection problem for regular path queries over semistructured data and two specific view-based query rewriting formalisms, namely single-word and arbitrary regular rewritings. We present an algorithm that for a given finite set of workload queries, i.e. for a 作者: 鍵琴 時(shí)間: 2025-3-24 19:59 作者: 上漲 時(shí)間: 2025-3-25 03:02
Coloring Geometric Range Spaces,mber of points contains points of many different colors. Using . colors, it is not always possible to ensure that every region containing . points contains all . colors. Thus, we introduce two relaxations: either we allow the number of colors to increase to .(.), or we require that the number of poi作者: 冷淡周邊 時(shí)間: 2025-3-25 03:41
Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Awae construction of such sets should be . in the sense that each node of the network should make decisions based only on the information obtained from nodes located a constant number of hops from it. In this paper we use the . of the network, i.e. the knowledge of position of nodes in the plane to pro作者: 接合 時(shí)間: 2025-3-25 11:04
Spanners of Complete ,-Partite Geometric Graphs,t has a “small” stretch factor and “few” edges. We present two algorithms for this problem. The first algorithm computes a (5?+?.)-spanner of . with .(.) edges in .(. log.) time. The second algorithm computes a (3?+?.)-spanner of . with .(. log.) edges in .(. log.) time. Finally, we show that there 作者: 深陷 時(shí)間: 2025-3-25 14:26
Minimum Cost Homomorphisms to Reflexive Digraphs,morphism to . of total cost not exceeding ...Minimum cost homomorphism problems encompass many well studied optimization problems such as list homomorphism problems, retraction and precolouring extension problems, chromatic partition optimization, and applied problems in repair analysis..For undirec作者: 投射 時(shí)間: 2025-3-25 17:57
On the Complexity of Reconstructing ,-free Graphs from Their Star Systems,given subsets . .,. .,???,. . of an .-element set . does there exist a graph .?=?(.,.) with {.[.]: .?∈?.}?=?{. .,. .,???,. .}? For a fixed graph . the .-free Star System problem is a variant of the Star System problem where it is asked whether a given set system is realizable by closed neighborhoods作者: 不透明 時(shí)間: 2025-3-25 21:07
Optimization and Recognition for ,,-minor Free Graphs in Linear Time, one. If the input graph has no . .-minor then the algorithm constructs a tree decomposition such that each node of the tree corresponds to a planar graph or a graph with eight vertices. Such a decomposition can be used to obtain algorithms to solve various optimization problems in linear time. For 作者: 平庸的人或物 時(shí)間: 2025-3-26 03:50 作者: 明智的人 時(shí)間: 2025-3-26 07:01 作者: arthroscopy 時(shí)間: 2025-3-26 08:35 作者: 歡樂東方 時(shí)間: 2025-3-26 15:05
I. Rapaport,K. Suchan,I. Todinca,J. Verstraete and in order to be relevant models must be constructed on a similar scale, several orders of magnitude greater than the objects that are normally attributed to the physicist‘s sphere of interest. The mechanicist is therefore aware of the limits of these models, no matter how elegant their mathemati作者: Commentary 時(shí)間: 2025-3-26 20:40 作者: 小隔間 時(shí)間: 2025-3-26 22:36
Stanislav Angelov,Keshav Kunal,Andrew McGregorurrently in use internationally.Explores construction contra.This book addresses the process and principles of contract management in construction from an international perspective. It presents a well-structured, in-depth analysis of construction law doctrines necessary to understand the fundamental作者: 皮薩 時(shí)間: 2025-3-27 03:18 作者: 扔掉掐死你 時(shí)間: 2025-3-27 06:10 作者: 舊石器時(shí)代 時(shí)間: 2025-3-27 11:06 作者: 美學(xué) 時(shí)間: 2025-3-27 13:57
Oscar H. Ibarra,Juhani Karhum?ki,Alexander Okhotinestions remain open—e.g., how to translate some physical insight into an appropriate mathematical objective/cost functional? what kind of optimization tools should be called on first? The objective of this chapter is to stress the difference between the theory and the practice—namely, in the practic作者: Increment 時(shí)間: 2025-3-27 20:19
Andreas Malettied for the formation of water molecules are transferred from both sides of the mitochondrial inner membranes in eukaryotic cells and of the cell membrane in prokaryotic cells .. The migration of positive and negative charges from the different sides of the membrane produces electric potential across作者: 鋸齒狀 時(shí)間: 2025-3-28 01:01
Sergey Afoninmutase, and dopamine β-monooxygenase. The redox reactions carried out by these enzymes are facilitated by the ability of copper to shuttle between the two oxidation states Cu(I) and Cu(II). Deficiencies of copper can lead to profound effects, because of the reduced activity of these copper-dependent作者: CHIP 時(shí)間: 2025-3-28 03:28
Rodrigo I. Silveira,Marc van Kreveld disease (CJD) remains a disease of very low incidence, accounting for 1 in 10. deaths per annum worldwide. BSE and CJD are examples of prion diseases, fatal neurodegenerative conditions .. Before the BSE epidemic, prion diseases were infamous because the cause could not be linked to a known pathoge作者: crescendo 時(shí)間: 2025-3-28 10:01 作者: 恫嚇 時(shí)間: 2025-3-28 12:31
J. Czyzowicz,S. Dobrev,T. Fevens,H. González-Aguilar,E. Kranakis,J. Opatrny,J. Urrutiamutase, and dopamine β-monooxygenase. The redox reactions carried out by these enzymes are facilitated by the ability of copper to shuttle between the two oxidation states Cu(I) and Cu(II). Deficiencies of copper can lead to profound effects, because of the reduced activity of these copper-dependent作者: dialect 時(shí)間: 2025-3-28 17:42 作者: Asperity 時(shí)間: 2025-3-28 19:14 作者: 有毛就脫毛 時(shí)間: 2025-3-29 02:46 作者: arbovirus 時(shí)間: 2025-3-29 04:09 作者: 流動(dòng)性 時(shí)間: 2025-3-29 09:58
Pinar Heggernes,Dieter Kratsch,Daniel Meisterous journey. Without the benefit of a space program, the human species has spent millions of years unaware of the wide range of cosmic dangers that lurk out in space. In some ways humans are playing Russian Roulette with a random set of rock and metal bullets that were first fired at this small six 作者: debase 時(shí)間: 2025-3-29 13:06
Profile of Tries,source (extension to Markov sources is possible). Our results are derived by methods of analytic algorithmics such as generating functions, Mellin transform, Poissonization and de-Poissonization, the saddle-point method, singularity analysis and uniform asymptotic analysis.作者: COLIC 時(shí)間: 2025-3-29 16:02 作者: FICE 時(shí)間: 2025-3-29 23:24
Optimal Higher Order Delaunay Triangulations of Polygons,e show that, in practice, it can be used to triangulate point sets optimally for small values of .. This represents the first practical result on optimization of higher order Delaunay triangulations for .?>?1.作者: 轉(zhuǎn)折點(diǎn) 時(shí)間: 2025-3-30 01:43 作者: OWL 時(shí)間: 2025-3-30 08:00
On the Complexity of Reconstructing ,-free Graphs from Their Star Systems,arge class of graphs the .-free Star System problem is NP-complete. In particular, the problem is NP-complete when . is either a cycle or a path on at least 5 vertices. This yields a complete dichotomy for paths and cycles.作者: Offstage 時(shí)間: 2025-3-30 10:12 作者: 反復(fù)拉緊 時(shí)間: 2025-3-30 13:55 作者: enumaerate 時(shí)間: 2025-3-30 16:38 作者: chuckle 時(shí)間: 2025-3-31 00:25 作者: 斑駁 時(shí)間: 2025-3-31 02:53
On Stateless Multihead Automata: Hierarchies and the Emptiness Problem, prove a tighter result: stateless (.?+?1)-head one-way automata are more powerful than stateless .-head one-way automata. Finally, we show that the emptiness problem for stateless 2-head two-way automata is undecidable.作者: entail 時(shí)間: 2025-3-31 06:28 作者: 凝視 時(shí)間: 2025-3-31 10:17
Coloring Geometric Range Spaces,nts in each region increases to .(.). We give upper bounds on .(.) and .(.) for halfspaces, disks, and pseudo-disks. We also consider the dual question, where we want to color regions instead of points. This is related to previous results of Pach, Tardos and Tóth on decompositions of coverings.作者: maroon 時(shí)間: 2025-3-31 16:11
Optimization and Recognition for ,,-minor Free Graphs in Linear Time,example, we present a linear time algorithm for finding an . seperator and a linear time algorithm for solving .-realisation on graphs without a . .-minor. Our algorithm will also be used, in a separate paper, as a key subroutine in a nearly linear time algorithm to test for the existence of an .-minor for any fixed ..作者: dialect 時(shí)間: 2025-3-31 19:07
action representations for these functions. This handbook is the result of such an endeavour. We emphasise that only 10% of the continued fractions contained in this book, can also be found in the Abramowitz and Stegun project or at the Wolfram website!.978-90-481-7775-2978-1-4020-6949-9作者: 笨拙處理 時(shí)間: 2025-4-1 01:19
G. Park,H. -K Hwang,P. Nicodème,W. Szpankowskiaction representations for these functions. This handbook is the result of such an endeavour. We emphasise that only 10% of the continued fractions contained in this book, can also be found in the Abramowitz and Stegun project or at the Wolfram website!.978-90-481-7775-2978-1-4020-6949-9作者: Frequency-Range 時(shí)間: 2025-4-1 01:49
Hervé Daudé,Vlady Ravelomanana modelling forces is based upon the principle oi virtual work. There are several advantages to thismethod. To begin with, it clearly emphasises the key role played by geometrical modelling, leading to mechanically consistent presentations in a systematic way. In addition, by requiring rigorous thoug作者: 一個(gè)攪動(dòng)不安 時(shí)間: 2025-4-1 07:56 作者: Musket 時(shí)間: 2025-4-1 13:04
Anupam Gupta,Kunal Talwarand require much expertise of any professional who wants to tackle any of them. Finally, a matrix providing loss and expense to claims is added at the end of the chapter (Table?.) to give contract managers a guide to identifying and calculating the relevant damages to a particular claim.
