Titlebook: Automata, Languages and Programming; 36th International C Susanne Albers,Alberto Marchetti-Spaccamela,Wolfga Conference proceedings 2009 Sp

阿谀奉承

书目名称Automata, Languages and Programming影响因子(影响力)




书目名称Automata, Languages and Programming影响因子(影响力)学科排名




书目名称Automata, Languages and Programming网络公开度




书目名称Automata, Languages and Programming网络公开度学科排名




书目名称Automata, Languages and Programming被引频次




书目名称Automata, Languages and Programming被引频次学科排名




书目名称Automata, Languages and Programming年度引用




书目名称Automata, Languages and Programming年度引用学科排名




书目名称Automata, Languages and Programming读者反馈




书目名称Automata, Languages and Programming读者反馈学科排名

temperate

SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphsis sublinear in terms of the maximum or average degree of the hypergraph. We extend this to the weighted case and give a . bound, where . is the average weighted degree in a hypergraph, matching the best bounds known for the special case of graphs. Our approach is to use an semi-definite technique t

Pseudoephedrine

Encumber

Sorting and Selection with Imprecise Comparisonse method requires performing all . comparisons then sorting elements according to the number of wins. The large number of comparisons is performed to counter the potentially faulty decision-making of the human subject, who acts as an imprecise comparator..We consider a simple model of the imprecise

Stagger

Fast ,derandomized by slightly increasing the running time. To derandomize our algorithm we construct a new kind of universal hash functions, that we coin .. For integers .,. and ., a family . of functions from [.] to [.] is called a universal (.,.,.)-coloring family if for any graph . on the set of verti

faucet

Bounds on the Size of Small Depth Circuits for Approximating Majoritytes Majority function on . variables is exp(.(..)). The lower bound for every . ≥ 2 and the upper bound for . = 2 have been previously shown by O’Donnell and Wimmer [ICALP’07], and the contribution of this paper is to give a matching upper bound for . ≥ 3.

蘑菇

LUDE

External Samplingand the algorithm is charged a unit cost for each block access. This model is well-studied, since it reflects the computational issues occurring when the (massive) input is stored on a disk. Since each block access operates on . data elements in parallel, many problems have external memory algorithm

DUST

Functional Monitoring without Monotonicityproblems arising in distributed systems, especially sensor networks. In this model, each of . sites reads a stream of tokens and is in communication with a central coordinator, who wishes to continuously monitor some function . of ., the union of the . streams. The goal is to minimize the number of

Iatrogenic