Results 1  10
of
146
Honey Encryption: Security Beyond the BruteForce Bound
, 2014
"... Version 1.2 We introduce honey encryption (HE), a simple, general approach to encrypting messages using low minentropy keys such as passwords. HE is designed to produce a ciphertext which, when decrypted with any of a number of incorrect keys, yields plausiblelooking but bogus plaintexts called ho ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
honey messages. A key benefit of HE is that it provides security in cases where too little entropy is available to withstand bruteforce attacks that try every key; in this sense, HE provides security beyond conventional bruteforce bounds. HE can also provide a hedge against partial disclosure of high
Local Search: Is bruteforce avoidable?
"... Many local search algorithms are based on searching in the kexchange neighborhood. This is the set of solutions that can be obtained from the current solution by exchanging at most k elements. As a rule of thumb, the larger k is, the better are the chances of finding an improved solution. However, ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
, for inputs of size n, a naïve bruteforce search of the kexchange neighborhood requires nO(k) time, which is not practical even for very small values of k. We show that for several classes of sparse graphs, like planar graphs, graphs of bounded vertex degree and graphs excluding some fixed graph as a minor
In BruteForce Search of Correlation Bounds for Polynomials
, 2011
"... We report on some initial results of a bruteforce search for determining the maximum correlation between degreed polynomials modulo p and the nbit mod q function. For various settings of the parameters n, d, p, and q, our results indicate that symmetric polynomials yield the maximum correlation. ..."
Abstract
 Add to MetaCart
We report on some initial results of a bruteforce search for determining the maximum correlation between degreed polynomials modulo p and the nbit mod q function. For various settings of the parameters n, d, p, and q, our results indicate that symmetric polynomials yield the maximum correlation
Representation Design and Bruteforce Induction in a Boeing Manufacturing Domain
 Applied Artificial Intelligence
, 1994
"... We applied inductive classification techniques to data collected in a Boeing plant with the goal of uncovering possible flaws in the manufacturing process. This application led us to explore two aspects of classical decisiontree induction: (1) Preprocessing and postprocessing and (2) bruteforce in ..."
Abstract

Cited by 46 (4 self)
 Add to MetaCart
We applied inductive classification techniques to data collected in a Boeing plant with the goal of uncovering possible flaws in the manufacturing process. This application led us to explore two aspects of classical decisiontree induction: (1) Preprocessing and postprocessing and (2) bruteforce
Representation Design and Bruteforce Induction in a Boeing Manufacturing Domain
 Applied Artificial Intelligence
, 1994
"... We applied inductive classification techniques to data collected in a Boeing plant with the goal of uncovering possible flaws in the manufacturing process. This application led us to explore two aspects of classical decisiontree induction: ffl Pre and Postprocessing: much of our effort was foc ..."
Abstract
 Add to MetaCart
was focused on the preprocessing of raw data to make it suitable for induction and the postprocessing of learned rules to make them useful to factory personnel. ffl Bruteforce Induction: in contrast with standard methods, which perform a greedy search of the space of decision trees, we formulated
Cover trees for nearest neighbor
 In Proceedings of the 23rd international conference on Machine learning
, 2006
"... ABSTRACT. We present a tree data structure for fast nearest neighbor operations in generalpoint metric spaces. The data structure requires space regardless of the metric’s structure. If the point set has an expansion constant � in the sense of Karger and Ruhl [KR02], the data structure can be const ..."
Abstract

Cited by 218 (0 self)
 Add to MetaCart
be constructed in � time. Nearest neighbor queries obeying the expansion bound require � time. In addition, the nearest neighbor of points can be queried in time. We experimentally test the algorithm showing speedups over the brute force search varying between 1 and 2000 on natural machine learning datasets. 1.
Hybrid Steered Molecular Dynamics Approach to Computing Absolute Binding Free Energy of Ligand−Protein Complexes: A Brute Force Approach That Is Fast and Accurate
"... ABSTRACT: Computing the free energy of binding a ligand to a protein is a difficult task of essential importance for which purpose various theoretical/computational approaches have been pursued. In this paper, we develop a hybrid steered molecular dynamics (hSMD) method capable of resolving one liga ..."
Abstract
 Add to MetaCart
ligand−protein complex within a few wallclock days with high enough accuracy to compare with the experimental data. This hSMD approach is based on the relationship between the binding affinity and the potential of mean force (PMF) in the established literature. It involves simultaneously steering n (n
Tight Bounds for Graph Homomorphism and Subgraph Isomorphism
"... We prove that unless Exponential Time Hypothesis (ETH) fails, deciding if there is a homomorphism from graph G to graph H cannot be done in time V (H)o(V (G)). We also show an exponentialtime reduction from Graph Homomorphism to Subgraph Isomorphism. This rules out (subject to ETH) a possibili ..."
Abstract
 Add to MetaCart
possibility of V (H)o(V (H))time algorithm deciding if graph G is a subgraph of H. For both problems our lower bounds asymptotically match the running time of bruteforce algorithms trying all possible mappings of one graph into another. Thus, our work closes the gap in the known complexity
BOUNDING THE NUMBER OF COLUMNS WHICH APPEAR ONLY IN POSITIVE POOLS
"... Abstract. dseparable, dseparable and ddisjunct matrices are the major tools in constructing pooling designs which has many applications to DNA experiments, for example, the clone library screening problem. While there exists a simple decoding for ddisjunct matrices, only bruteforce methods are ..."
Abstract
 Add to MetaCart
Abstract. dseparable, dseparable and ddisjunct matrices are the major tools in constructing pooling designs which has many applications to DNA experiments, for example, the clone library screening problem. While there exists a simple decoding for ddisjunct matrices, only bruteforce methods
Temporal Synthesis for Bounded Systems and Environments
"... Temporal synthesis is the automated construction of a system from its temporal specification. It is by now realized that requiring the synthesized system to satisfy the specifications against all possible environments may be too demanding, and, dually, allowing all systems may be not demanding enoug ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
the synthesis problem into a search problem, and one cannot expect to do better than bruteforce search. In particular, the synthesis problem for bounded systems and environment is ΣP 2complete (in terms of the bounds, for a specification given by a deterministic automaton). We also show that while bounding
Results 1  10
of
146