Titlebook: Computing and Combinatorics; 20th International C Zhipeng Cai,Alex Zelikovsky,Anu Bourgeois Conference proceedings 2014 Springer Internatio

Monroe

书目名称Computing and Combinatorics影响因子(影响力)




书目名称Computing and Combinatorics影响因子(影响力)学科排名




书目名称Computing and Combinatorics网络公开度




书目名称Computing and Combinatorics网络公开度学科排名




书目名称Computing and Combinatorics被引频次




书目名称Computing and Combinatorics被引频次学科排名




书目名称Computing and Combinatorics年度引用




书目名称Computing and Combinatorics年度引用学科排名




书目名称Computing and Combinatorics读者反馈




书目名称Computing and Combinatorics读者反馈学科排名

客观

,-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

万灵丹

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

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

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

dysphagia

愉快吗

迅速成长

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