共查询到20条相似文献,搜索用时 31 毫秒
1.
Abstract. We describe a quantum black-box network computing the majority of N bits with zero-sided error ɛ using only
queries: the algorithm returns the correct answer with probability at least 1 - ɛ , and ``I don't know' otherwise. Our algorithm is given as a randomized ``XOR decision tree' for which the number of queries
on any input is strongly concentrated around a value of at most 2/3N . We provide a nearly matching lower bound of
on the expected number of queries on a worst-case input in the randomized XOR decision tree model with zero-sided error
o(1) . Any classical randomized decision tree computing the majority on N bits with zero-sided error 1/2 has cost N . 相似文献
2.
We show that several discrepancy-like problems can be solved in NC nearly achieving the discrepancies guaranteed by a probabilistic analysis and achievable sequentially. For example, we describe an NC algorithm that given
a set system (X, S) , where X is a ground set and S⊆2
X
, computes a set R⊆X so that for each S∈
S the discrepancy ||R
S|-|R-∩S|| is
. Whereas previous NC algorithms could only achieve discrepancies
with ɛ>0 , ours matches the probabilistic bound within a multiplicative factor 1+o(1) . Other problems whose NC solution we improve are lattice approximation, ɛ -approximations of range spaces with constant VC-exponent, sampling in geometric configuration spaces, approximation of integer
linear programs, and edge coloring of graphs.
Received June 26, 1998; revised February 18, 1999. 相似文献
3.
Abstract. We present a competitive analysis of the LRFU paging algorithm, a hybrid of the LRU (Least Recently Used) and LFU (Least
Frequently Used) paging algorithms. We show that the competitive ratio of LRFU is k +
log(1-λ ) / logλ
- 1, where 1/2 < ≤
λ
≤ 1 is the decay parameter used by the LRFU algorithm, and k is the size of the cache. This supplies, in particular, the first natural paging algorithms that are competitive but are
not optimally competitive, answering a question of Borodin and El-Yaniv. Although LRFU, as it turns out, is not optimally
competitive, it is expected to behave well in practice, as it combines the benefits of both LRU and LFU. 相似文献
4.
Abstract. Given a graph G=(V,E) and a set of vertices M
V , a vertex v ∈ V is said to be controlled by M if the majority of v 's neighbors (including itself) belong to M . M is called a monopoly in G if every vertex v∈ V is controlled by M . For a specified M and a given range for edge set E (E
1
E
E
2
), we try to determine an E such that M is a monopoly in G=(V,E) . We first present a polynomial algorithm for testing if such an E exists, by formulating it as a network flow problem. Assuming that a solution for E does exist, we then show that solutions with the maximum and minimum |E| , respectively, can be found in polynomial time, by solving weighted matching problems.
In case there is no solution for E , we want to maximize the number of vertices controlled by the given M . Unfortunately, this problem turns out to be NP-hard. We, therefore, design a simple approximation algorithm which guarantees
an approximation ratio of 2 . 相似文献
5.
We show how to maintain efficiently a minimum piercing set for a set S of intervals on the line, under insertions and deletions to/from S. A linear-size dynamic data structure is presented, which enables us to compute a new minimum piercing set following an insertion or deletion in time O(c( S) log |S|), where c (S) is the size of the new minimum piercing set. We also show how to maintain a piercing set for S of size at most (1+?)c (S), for 0 < ? ≤ 1 , in $\bar O$ ((log |S|)/?) amortized time per update. We then apply these results to obtain efficient solutions to the following three problems: (i) the shooter location problem, (ii) computing a minimum piercing set for arcs on a circle, and (iii) dynamically maintaining a box cover for a d -dimensional point set. 相似文献
6.
Mohammad Ali Abam Mark de Berg Mohammad Farshi Joachim Gudmundsson Michiel Smid 《Algorithmica》2011,61(1):207-225
Let (S,d) be a finite metric space, where each element p∈S has a non-negative weight w (p). We study spanners for the set S with respect to the following weighted distance function:
$\mathbf{d}_{\omega}(p,q)=\left\{{ll}0&\mbox{ if $\mathbf{d}_{\omega}(p,q)=\left\{\begin{array}{ll}0&\mbox{ if 相似文献
7.
We give a deterministic algorithm which, on input an integer n , collection \cal F of subsets of {1,2,\ldots,n} , and ɛ∈ (0,1) , runs in time polynomial in n| \cal F |/ɛ and produces a \pm 1 -matrix M with n columns and m=O(log | \cal F |/ɛ
2
) rows with the following property: for any subset F ∈ \cal F , the fraction of 1's in the n -vector obtained by coordinatewise multiplication of the column vectors indexed by F is between (1-ɛ)/2 and (1+ɛ)/2 . In the case that \cal F is the set of all subsets of size at most k , k constant, this gives a polynomial time construction for a k -wise ɛ -biased sample space of size O(log n/ɛ
2
) , compared with the best previous constructions in [NN] and [AGHP] which were, respectively, O(log n/ɛ
4
) and O(log
2
n/ɛ
2
) . The number of rows in the construction matches the upper bound given by the probabilistic existence argument. Such constructions
are of interest for derandomizing algorithms.
As an application, we present a family of essentially optimal deterministic communication protocols for the problem of checking
the consistency of two files.
Received October 30, 1997; revised September 17, 1999, and April 17, 2000. 相似文献
8.
Abstract. We consider the problem of computing minimum congestion, fault-tolerant, redundant assignments of messages to faulty, parallel
delivery channels. In particular, we are given a set K of faulty channels, each having an integer capacity c
i
and failing independently with probability f
i
. We are also given a set M of messages to be delivered over K , and a fault-tolerance constraint (1-ɛ) , and we seek a redundant assignment ϕ that minimizes congestion \lilsf Cong(ϕ) , i.e. the maximum channel load, subject to the constraint that, with probability no less than (1-ɛ) , all the messages have a copy on at least one active channel. We present a polynomial-time 4-approximation algorithm for
identical capacity channels and arbitrary message sizes, and a 2 \lceil\ln(|K|/\e)/\ln(1/f
max
) \rceil -approximation algorithm for related capacity channels and unit size messages.
Both algorithms are based on computing a collection {K
1
, \ldots, K
ν
} of disjoint channel subsets such that, with probability no less than (1-ɛ) , at least one channel is active in each subset. The objective is to maximize the sum of the minimum subset capacities. Since
the exact version of this problem is NP -complete, we provide a 2-approximation algorithm for identical capacities, and a polynomial-time (8+ \rm o (1)) -approximation algorithm for arbitrary capacities. 相似文献
9.
This paper deals with approximating feedback sets in directed graphs. We consider two related problems: the weighted feedback vertex set (FVS) problem, and the weighted feedback edge set (FES) problem. In the {FVS} (resp. FES) problem, one is given a directed graph with weights (each of which is at least one) on the vertices (resp. edges), and is
asked to find a subset of vertices (resp. edges) with minimum total weight that intersects every directed cycle in the graph.
These problems are among the classical NP-hard problems and have many applications. We also consider a generalization of these
problems: subset-fvs and subset-fes, in which the feedback set has to intersect only a subset of the directed cycles in the graph. This subset consists of all
the cycles that go through a distinguished input subset of vertices and edges, denoted by X . This generalization is also NP-hard even when |X|=2 . We present approximation algorithms for the subset-fvs and subset-fes problems. The first algorithm we present achieves an approximation factor of O(log
2
|X|) . The second algorithm achieves an approximation factor of O(min{log τ
*
log log τ
*
, log n log log n)} , where τ
*
is the value of the optimum fractional solution of the problem at hand, and n is the number of vertices in the graph. We also define a multicut problem in a special type of directed networks which we
call circular networks, and show that the subset-fes and subset-fvs problems are equivalent to this multicut problem. Another contribution of our paper is a combinatorial algorithm that computes a (1+ɛ) approximation to the fractional optimal feedback vertex set. Computing the approximate solution is much simpler and more
efficient than general linear programming methods. All of our algorithms use this approximate solution.
Received May 31, 1995; revised June 11, 1996, and October 9, 1996. 相似文献
10.
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead
of the full set of results leads to efficient approximate algorithms for several applications, such as:
11.
Abstract. We consider a simple restriction of the PRAM model (called PPRAM), where the input is arbitrarily partitioned between a fixed
set of p processors and the shared memory is restricted to m cells. This model allows for investigation of the tradeoffs/ bottlenecks with respect to the communication bandwidth (modeled by the shared memory size m ) and the number of processors p . The model is quite simple and allows the design of optimal algorithms without losing the effect of communication bottlenecks.
We have focused on the PPRAM complexity of problems that have
12.
Abstract. We study the quantum complexity of the static set membership problem: given a subset S (|S| ≤ n ) of a universe of size m ( >> n ), store it as a table, T: {0,1}
r
--> {0,1} , of bits so that queries of the form ``Is x in S ?' can be answered. The goal is to use a small table and yet answer queries using few bit probes. This problem was considered
recently by Buhrman et al. [BMRV], who showed lower and upper bounds for this problem in the classical deterministic and randomized
models. In this paper we formulate this problem in the ``quantum bit probe model'. We assume that access to the table T is provided by means of a black box (oracle) unitary transform O
T
that takes the basis state | y,b > to the basis state | y,b
13.
Abstract. We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list,
and deciding whether the numbers in a list are all distinct. Letting N be the number of elements in the input list, we prove a lower bound of (1/π )(ln(N )-1) accesses to the list elements for ordered searching, a lower bound of Ω(N logN ) binary comparisons for sorting, and a lower bound of
14.
Alexander D. Healy 《Computational Complexity》2008,17(1):3-37
We construct a randomness-efficient averaging sampler that is computable by uniform constant-depth circuits with parity gates (i.e., in uniform AC
0[⊕]). Our sampler matches the parameters achieved by random walks on constant-degree expander graphs, allowing us to apply
a variety expander-based techniques within NC
1. For example, we obtain the following results:
15.
We present a randomized EREW PRAM algorithm to find a minimum spanning forest in a weighted undirected graph. On an n -vertex graph the algorithm runs in o(( log n)
1+
ɛ
) expected time for any ɛ >0 and performs linear expected work. This is the first linear-work, polylog-time algorithm on the EREW PRAM for this problem.
This also gives parallel algorithms that perform expected linear work on two general-purpose models of parallel computation—the
QSM and the BSP. 相似文献
16.
V. R. Fatalov 《Problems of Information Transmission》2010,46(1):62-85
Let w(t) be a standard Wiener process, w(0) = 0, and let η
a
(t) = w(t + a) − w(t), t ≥ 0, be increments of the Wiener process, a > 0. Let Z
a
(t), t ∈ [0, 2a], be a zeromean Gaussian stationary a.s. continuous process with a covariance function of the form E
Z
a
(t)Z
a
(s) = 1/2[a − |t − s|], t, s ∈ [0, 2a]. For 0 < p < ∞, we prove results on sharp asymptotics as ɛ → 0 of the probabilities
|
设为首页 | 免责声明 | 关于勤云 | 加入收藏 |
Copyright©北京勤云科技发展有限公司 京ICP备09084417号 |