標題: Titlebook: Computing and Combinatorics; 20th International C Zhipeng Cai,Alex Zelikovsky,Anu Bourgeois Conference proceedings 2014 Springer Internatio [打印本頁] 作者: Monroe 時間: 2025-3-21 17:23
書目名稱Computing and Combinatorics影響因子(影響力)
書目名稱Computing and Combinatorics影響因子(影響力)學科排名
書目名稱Computing and Combinatorics網(wǎng)絡(luò)公開度
書目名稱Computing and Combinatorics網(wǎng)絡(luò)公開度學科排名
書目名稱Computing and Combinatorics被引頻次
書目名稱Computing and Combinatorics被引頻次學科排名
書目名稱Computing and Combinatorics年度引用
書目名稱Computing and Combinatorics年度引用學科排名
書目名稱Computing and Combinatorics讀者反饋
書目名稱Computing and Combinatorics讀者反饋學科排名
作者: 客觀 時間: 2025-3-21 22:15
,-Discrepancy Analysis of Polynomial-Time Deterministic Samplers Emulating Rapidly Mixing Chains . algorithm based on ., such as the rotor-router model (a.k.a. Propp machine). For the algorithm, we give an upper bound of the point-wise distance (i.e., infinity norm) between the “distributions” of a deterministic random walk and its corresponding Markov chain in terms of the . of the Markov cha作者: 萬靈丹 時間: 2025-3-22 00:53
Sampling Query Feedback Restricted Repairs of Functional Dependency Violations: Complexity and AlgorSampling from the repair space is an alternative approach meeting the needs of many applications. In this paper, we introduce a new class of repair, query feedback restricted repair, based on the feedback on user’s witness query. We first map out a complete picture of both data and combined complexi作者: minion 時間: 2025-3-22 05:21
Online Prediction Problems with Variationng to an .-dimensional linear loss vector, and aim to minimize the regret. In this paper, we consider a new measure of the loss functions, which we call .... Consider the loss functions with small ..-variation, if the player is allowed to have some information related to the variation in each round,作者: heterodox 時間: 2025-3-22 12:21
Nondeterministic Automatic Complexity of Almost Square-Free and Strongly Cube-Free Wordsatisfies .. We improve that result by showing that .. For nondeterministic automatic complexity we show .. We prove that such complexity .. of a word . of length . satisfies .. This enables us to define the complexity deficiency .(.)?=?.(.)???..(.). If . is square-free then .(.)?=?0. If . almost squ作者: dysphagia 時間: 2025-3-22 15:31 作者: dysphagia 時間: 2025-3-22 19:22 作者: 愉快嗎 時間: 2025-3-22 22:15 作者: 迅速成長 時間: 2025-3-23 03:27
One-Dimensional ,-Center on Uncertain Data-center problem on one-dimensional uncertain data. The input is a set . of (weighted) uncertain points on a real line, and each uncertain point is specified by its probability density function (pdf) which is a piecewise-uniform function (i.e., a histogram). The goal is to find a set of . of . points作者: Exaggerate 時間: 2025-3-23 08:24 作者: 災(zāi)禍 時間: 2025-3-23 11:32
Competitive Cost-Savings in Data Stream Management Systems Management System (DSMS) to continuously monitor the infinite input stream of data tuples. Optimizing the processing of these ACQs is crucial in order for the DSMS to operate at the adequate required scalability. One optimization technique is to share the results of partial aggregation operations b作者: 怎樣才咆哮 時間: 2025-3-23 16:08 作者: auxiliary 時間: 2025-3-23 18:03 作者: archenemy 時間: 2025-3-23 22:20
Parameterized Complexity of Edge Interdiction Problemsely, an interdictor and an evader, who compete on an objective with opposing interests. In an edge interdiction problem, every edge of the input graph is associated with an interdiction cost. The interdictor interdicts the graph by modifying the edges in the graph and the number of such modification作者: Guileless 時間: 2025-3-24 02:51 作者: 緯度 時間: 2025-3-24 10:07 作者: orient 時間: 2025-3-24 12:56 作者: 保全 時間: 2025-3-24 14:58
The Power of Duples (in Self-Assembly): It’s Not So Hip to Be Squarellows for not only the standard square tiles, but also “duple” tiles which are rectangles pre-formed by the joining of two square tiles. We show that the addition of duples allows for powerful behaviors of self-assembling systems at temperature 1, meaning systems which exclude the requirement of coo作者: 走路左晃右晃 時間: 2025-3-24 19:18
A. G. De Jong,C. J. HoogendoornPolynomial Identity Testing (PIT) algorithms have focussed on polynomials computed either by small alternation-depth arithmetic circuits, or by read-restricted formulas. Read-once polynomials (ROPs) are computed by read-once formulas (ROFs) and are the simplest of read-restricted polynomials. Building structures above these, we show: 作者: 的闡明 時間: 2025-3-25 00:24 作者: 執(zhí)拗 時間: 2025-3-25 05:45
Normal Form Expressions of Propositional Projection Temporal Logicunction of formulas in form of . or .. Here . denotes a finite model with length being . while . indicates an infinite model. We show that any PPTL formula can be expressed as a normal form expression. As a consequence, satisfiability of PPTL formulas can easily be achieved.作者: Frisky 時間: 2025-3-25 11:22
https://doi.org/10.1007/978-3-319-08783-2approximation algorithms; data mining; formal methods; markov chain monte carlo methods; parameterized c作者: Endemic 時間: 2025-3-25 13:27
978-3-319-08782-5Springer International Publishing Switzerland 2014作者: 芳香一點 時間: 2025-3-25 19:00 作者: intimate 時間: 2025-3-25 21:04 作者: duplicate 時間: 2025-3-26 03:43 作者: Muscularis 時間: 2025-3-26 07:34 作者: Vo2-Max 時間: 2025-3-26 09:41 作者: Frenetic 時間: 2025-3-26 14:47 作者: 全神貫注于 時間: 2025-3-26 17:09 作者: 考得 時間: 2025-3-26 23:07
https://doi.org/10.1007/978-3-540-71400-2unction of formulas in form of . or .. Here . denotes a finite model with length being . while . indicates an infinite model. We show that any PPTL formula can be expressed as a normal form expression. As a consequence, satisfiability of PPTL formulas can easily be achieved.作者: COMMA 時間: 2025-3-27 03:12 作者: 600 時間: 2025-3-27 07:58 作者: legacy 時間: 2025-3-27 12:33
Thermal Stress Resistance of Materialsefficiently answer queries asking if . contains a 1 or not. We consider both orthogonal and non-orthogonal shapes for . including rectangles, axis-parallel right-triangles, certain types of polygons, and spheres. We provide space-efficient deterministic and randomized algorithms with constant query 作者: 磨碎 時間: 2025-3-27 17:17
Jenq-Gong Duh,Kuo-Chuan Liu,Bi-Shiou Chiou Management System (DSMS) to continuously monitor the infinite input stream of data tuples. Optimizing the processing of these ACQs is crucial in order for the DSMS to operate at the adequate required scalability. One optimization technique is to share the results of partial aggregation operations b作者: 聽覺 時間: 2025-3-27 21:18
Basic Laws of Thermoelasticity,her there exists a string . over Σ such that ..(.,..)?≤?., .?∈?{1,…, .}, where ..(.,.) denotes the number of places strings . and . differ at. . is a prototype string problem. This problem together with several of its variants such as . and . have been extensively studied from parameterized complexi作者: faculty 時間: 2025-3-28 01:27 作者: 調(diào)味品 時間: 2025-3-28 06:07
Basic Laws of Thermoelasticity,ely, an interdictor and an evader, who compete on an objective with opposing interests. In an edge interdiction problem, every edge of the input graph is associated with an interdiction cost. The interdictor interdicts the graph by modifying the edges in the graph and the number of such modification作者: Hla461 時間: 2025-3-28 09:42
Thermal Expansion in Piping Systems,other hand, the hitting set problem, when asked in the context of induced geometric objects, often turns out to be exactly the vertex cover problem on restricted classes of graphs. In this work we explore a particular instance of such a phenomenon. We consider the problem of hitting all axis-paralle作者: Ardent 時間: 2025-3-28 13:31
Solid Mechanics and Its Applicationsonest, the verifier outputs (.,.(.)) with probability close to .(.)..In case the prover is dishonest, one may hope for the following guarantee: if the verifier outputs (.,.), then the probability that the verifier outputs . is close to .. Simple examples show that this cannot be achieved. Instead, w作者: 心胸開闊 時間: 2025-3-28 17:17
https://doi.org/10.1007/978-1-4020-9247-3he average-case hardness of an .-problem on the worst-case complexity of an .-complete problem. We replace the hiding and the heavy samples protocol in [BT03] by employing the histogram verification protocol of Haitner, Mahmoody and Xiao (CCC, 2010), which proves to be very useful in this context. O作者: 朦朧 時間: 2025-3-28 22:43
Thermal Expansion in Piping Systems,llows for not only the standard square tiles, but also “duple” tiles which are rectangles pre-formed by the joining of two square tiles. We show that the addition of duples allows for powerful behaviors of self-assembling systems at temperature 1, meaning systems which exclude the requirement of coo作者: NICHE 時間: 2025-3-29 01:49 作者: MODE 時間: 2025-3-29 05:48
https://doi.org/10.1007/978-3-540-71400-2unction of formulas in form of . or .. Here . denotes a finite model with length being . while . indicates an infinite model. We show that any PPTL formula can be expressed as a normal form expression. As a consequence, satisfiability of PPTL formulas can easily be achieved.作者: 聽覺 時間: 2025-3-29 09:01
An Axiomatization for Cylinder Computation Modelf sequence expressions and logical laws regarding CCM operators are proved. Moreover, the axiom system of CCM-PPTL is established by extending that of PPTL with some axioms and inference rules of CCM operators. In addition, the soundness and completeness of the system are proved.作者: Inclement 時間: 2025-3-29 14:21 作者: 口訣 時間: 2025-3-29 16:08
A New View on Worst-Case to Average-Case Reductions for NP Problemsn [BT03] by employing the histogram verification protocol of Haitner, Mahmoody and Xiao (CCC, 2010), which proves to be very useful in this context. Once the histogram is verified, our hiding protocol is directly public-coin, whereas the intuition behind the original protocol inherently relies on private coins.作者: gusher 時間: 2025-3-29 23:35
Thermal Stress Resistance of Materialsdomain ., when the average positive frequency .?=?../.. is sufficiently large. We consider the following range of parameters: .?≥?log(.) and sample rate .?≥?....log(.), where .. is a constant. On these streams we improve the bound from . to . thus giving polynomial improvement in space for sufficiently large . and ...作者: 召集 時間: 2025-3-30 00:52
0302-9743 anta, GA, USA, in August 2014. The 51 revised full papers presented were carefully reviewed and selected from 110 submissions. There was a co-organized workshop on computational social networks (CSoNet 2014) where 8 papers were accepted. The papers cover the following topics: sampling and randomized作者: Memorial 時間: 2025-3-30 04:55
Thermal Stress Resistance of Materialsf sequence expressions and logical laws regarding CCM operators are proved. Moreover, the axiom system of CCM-PPTL is established by extending that of PPTL with some axioms and inference rules of CCM operators. In addition, the soundness and completeness of the system are proved.作者: SLAG 時間: 2025-3-30 12:13 作者: Incisor 時間: 2025-3-30 14:29 作者: Onerous 時間: 2025-3-30 19:19
0302-9743 biology and computational geometry; approximation algorithm; graph theory and algorithms; game theory and cryptography; scheduling algorithms and circuit complexity and CSoNet.978-3-319-08782-5978-3-319-08783-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 哪有黃油 時間: 2025-3-30 22:41
Basic Laws of Thermoelasticity,ll this gap in the literature and do a comprehensive study of these problems from kernelization complexity perspective. We almost settle all the problems by either obtaining a polynomial kernel or showing that the problem does not admit a polynomial kernel assuming a complexity theoretic assumption.作者: grieve 時間: 2025-3-31 04:28 作者: JAMB 時間: 2025-3-31 05:14
Solid Mechanics and Its Applicationsns. The verifier has better running time compared to the well-known Goldwasser-Sipser transformation (STOC, 1986). For constant-round protocols, we only lose an arbitrarily small constant in soundness and completeness, while our public-coin verifier calls the private-coin verifier only once.
