Results 11  20
of
331
Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers
"... A kquery Locally Decodable Code (LDC) encodes an nbit message x as an Nbit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only k bits of the codeword C(x), even after some constant fraction of codeword bits has been corrupted. The major goal of LD ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
prime factor p>m γ yields a family of k(γ)query locally decodable codes of length exp � n 1/t �. Conversely, if for some fixed k and all ɛ>0 one can use the nice subsets technique to obtain a family of kquery LDCs of length exp (n ɛ);then infinitely many Mersenne numbers have prime factors
Approximating Geometrical Graphs Via Spanners and Banyans
, 1998
"... The main result of this paper is an improvement of Arora's method to find (1+ ffl) approximations for geometric NPhard problems including the Euclidean Traveling Salesman Problem and the Euclidean Steiner Minimum Tree problems. For fixed dimension d and ffl, our algorithms run in O(N log N) t ..."
Abstract

Cited by 66 (0 self)
 Add to MetaCart
of A is contained in S. We give a construction for banyans such that the total length of the line segments in S is within a constant factor of the length of the minimum spanning tree of A, and jA 0 j = O(jAj), when ffl and d are fixed. In this abbreviated paper, we only provide proofs
Quantum LDPC Codes Constructed from PointLine Subsets of the Finite Projective Plane
"... Abstract—Due to their fast decoding algorithms, quantum generalizations of lowdensity parity check, or LDPC, codes have been investigated as a solution to the problem of decoherence in fragile quantum states. However, the additional twisted inner product requirements of quantum stabilizer codes fo ..."
Abstract
 Add to MetaCart
force fourcycles and eliminate the possibility of randomly generated quantum LDPC codes. Moreover, the classes of quantum LDPC codes discovered thus far generally have unknown or small minimum distance, or a fixed rate. This paper presents several new classes of quantum LDPC codes constructed from
Splitters and nearoptimal derandomization
"... We present a fairly general method for finding deterministic constructions obeying what we call krestrictions; this yields structures of size not much larger than the probabilistic bound. The structures constructed by our method include (n; k)universal sets (a collection of binary vectors of lengt ..."
Abstract

Cited by 60 (1 self)
 Add to MetaCart
of length n such that for any subset of size k of the indices, all 2k configurations appear) and families of perfect hash functions. The nearoptimal constructions of these objects imply the very efficient derandomization of algorithms in learning, of fixedsubgraph finding algorithms, and of near optimal
Dynamic control of a queue with adjustable service rate
 Oper. Res
"... We consider a singleserver queue with Poisson arrivals, where holding costs are continuously incurred as a nondecreasing function of the queue length. The queue length evolves as a birthanddeath process with constant arrival rate λ =1andwith statedependent service rates µn that can be chosen fr ..."
Abstract

Cited by 52 (1 self)
 Add to MetaCart
from a fixed subset A of [0, ∞). Finally, there is a nondecreasing costofeffort function c(·) onA, andservicecosts are incurred at rate c(µn) when the queue length is n. The objective is to minimize average cost per time unit over an infinite planning horizon. The standard optimality equation
Detecting backdoor sets with respect to horn and binary clauses
 In SAT’04
, 2004
"... Abstract. We study the parameterized complexity of detecting backdoor sets for instances of the propositional satisfiability problem (SAT) with respect to the polynomially solvable classes horn and 2cnf. A backdoor set is a subset of variables; for a strong backdoor set, the simplified formulas res ..."
Abstract

Cited by 40 (13 self)
 Add to MetaCart
parameter tractable (the existence of a set of size k for a formula of length N can be decided in time f(k)N O(1)), but that the detection of a weak backdoor set is W[2]hard, implying that this problem is not fixedparameter tractable. 1
ON COMPLETENESS OF RANDOM TRANSITION COUNT FOR MARKOV CHAINS
, 2004
"... Abstract. It is shown that the random transition count is complete for Markov chains with a fixed length and a fixed initial state, for some subsets of the set of all transition probabilities. 1. ..."
Abstract
 Add to MetaCart
Abstract. It is shown that the random transition count is complete for Markov chains with a fixed length and a fixed initial state, for some subsets of the set of all transition probabilities. 1.
Multiple Pattern Avoidance with Respect to Fixed Points and Excedances
, 2004
"... We study the distribution of the statistics `number of fixed points' and `number of excedances' in permutations avoiding subsets of patterns of length 3. We solve all the cases of simultaneous avoidance of more than one pattern, giving generating functions enumerating these two statisti ..."
Abstract

Cited by 13 (6 self)
 Add to MetaCart
We study the distribution of the statistics `number of fixed points' and `number of excedances' in permutations avoiding subsets of patterns of length 3. We solve all the cases of simultaneous avoidance of more than one pattern, giving generating functions enumerating these two
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
, 2008
"... Abstract. Consider an abstract storage device Σ(G) that can hold a single element x from a fixed, publicly known finite group G. Storage is private in the sense that an adversary does not have read access to Σ(G) at all. However, Σ(G) is nonrobust in the sense that the adversary can modify its cont ..."
Abstract

Cited by 50 (8 self)
 Add to MetaCart
Abstract. Consider an abstract storage device Σ(G) that can hold a single element x from a fixed, publicly known finite group G. Storage is private in the sense that an adversary does not have read access to Σ(G) at all. However, Σ(G) is nonrobust in the sense that the adversary can modify its
Indexing and retrieval of words in old documents
 In: Proc. 7th Int.l Conf. Document Analysis and Recognition
, 2003
"... This paper describes a system for efficient indexing and retrieval of words in collections of document images. The proposed method is based on two main principles: unsupervised prototype clustering, and string encoding for efficient string matching. During indexing, a self organizing map (SOM) is tr ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
) is trained so as to cluster together similar symbols (characterlike objects) in a subset of the documents to be stored. By using the trained SOM the words in the whole collection can be stored and represented with a fixedlength description, that can be easily compared in order to score most similar words
Results 11  20
of
331