Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
9,186
On an optimal deterministic algorithm for SAT
- In: Proc 12th International Workshop, CSL'98. Lecture Notes in Computer Science
, 1999
"... . J. Kraj'icek and P. Pudl'ak proved that an almost optimal deterministic algorithm for TAUT exists if and only if there exists a poptimal proof system for TAUT . In this paper we prove that an almost optimal deterministic algorithm for SAT exists if and only if there exists a p-optima ..."
Abstract
-
Cited by 7 (1 self)
- Add to MetaCart
. J. Kraj'icek and P. Pudl'ak proved that an almost optimal deterministic algorithm for TAUT exists if and only if there exists a poptimal proof system for TAUT . In this paper we prove that an almost optimal deterministic algorithm for SAT exists if and only if there exists a p
A DETERMINISTIC ALGORITHM FOR THE MCD
, 2010
"... The minimum covariance determinant (MCD) method is a robust estimator of multivariate location and scatter (Rousseeuw, 1984). The MCD is highly resistant to outliers, and it is often applied by itself and as a building block for other robust multivariate methods. Computing the exact MCD is very hard ..."
Abstract
- Add to MetaCart
invariant. In this article we present a deterministic algorithm, denoted as DetMCD, which does not use random subsets and is even faster. It is permutation invariant and very close to affine equivariant. We illustrate DetMCD on real and simulated data sets, with applications involving principal component
Deterministic Algorithms for Matrix Completion
"... The goal of the matrix completion problem is to retrieve an unknown real matrix from a small subset of its entries. This problem comes up in many application areas, and has received a great deal of attention in the context of the Net ix challenge. This setup usually represents our partial knowledge ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
that agrees with the partially speci ed matrix. The performance of the above algorithm under the assumption that the revealed entries are sampled randomly has received considerable attention (e.g. [16, 17, 6, 4, 3, 15, 9, 10]). Here we ask what can be said if the observed entries are chosen deterministically
An Efficient Deterministic Algorithm for the
"... We address the problem of how best to get a group of machines on a network to learn of each others existence; this is referred to as the Resource Discovery Problem (RDP). Straightforward algorithms for RDP are slow or have high communication cost. Harchol et al. [3] recently presented name-droppe ..."
Abstract
- Add to MetaCart
convergence can be detected; in order to provide a high probability of convergence, the number of machines on the network must be known a priori to all machines. We present fast-leader, a deterministic distributed algorithm for RDP which overcomes these limitations while matching name-dropper's time
Deterministic algorithms for sampling count data
, 2007
"... Processing and extracting meaningful knowledge from count data is an important problem in data mining. The volume of data is increasing dramatically as the data is generated by day-to-day activities such as market basket data, web clickstream data or network data. Most mining and analysis algorithms ..."
Abstract
-
Cited by 6 (1 self)
- Add to MetaCart
algorithms require multiple passes over the data, which requires extreme amounts of time. One solution to save time would be to use samples, since sampling is a good surrogate for the data and the same sample can be used to answer many kinds of queries. In this paper, we propose two deterministic sampling
Deterministic Algorithms for the Lovasz Local Lemma
, 2010
"... The Lovász Local Lemma [5] (LLL) is a powerful result in probability theory that states that the probability that none of a set of bad events happens is nonzero if the probability of each event is small compared to the number of events that depend on it. It is often used in combination with the prob ..."
Abstract
-
Cited by 11 (4 self)
- Add to MetaCart
efficiently. Specifically, for a k-CNF formula with m clauses and d ≤ 2 k/(1+ɛ) /e for some ɛ ∈ (0, 1), we give an algorithm that finds a satisfying assignment in time Õ(m2(1+1/ɛ)). This improves upon the deterministic algorithms of Moser and of Moser-Tardos with running times m Ω(k2) and m Ω(k·1/ɛ) which
A Deterministic Algorithm for the Three-Dimensional Diameter Problem
, 1992
"... We give a deterministic algorithm for computing the diameter of an n point set in three dimensions with O(n log^c n) running time, c a constant. ..."
Abstract
-
Cited by 26 (2 self)
- Add to MetaCart
We give a deterministic algorithm for computing the diameter of an n point set in three dimensions with O(n log^c n) running time, c a constant.
shaping controlled by a deterministic algorithm
, 2013
"... Optimization of ultra-fast interactions using laser pulse temporal ..."
Results 1 - 10
of
9,186
