Results 1  10
of
2,884,320
Brute force searching, the typical set and Guesswork
"... Abstract—Consider the situation where a word is chosen probabilistically from a finite list. If an attacker knows the list and can inquire about each word in turn, then selecting the word via the uniform distribution maximizes the attacker’s difficulty, its Guesswork, in identifying the chosen word. ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
. It is tempting to use this property in cryptanalysis of computationally secure ciphers by assuming coded words are drawn from a source’s typical set and so, for all intents and purposes, uniformly distributed within it. By applying recent results on Guesswork, for i.i.d. sources it is this equipartition ansatz
Mourik, “Statistical mechanics of typical set decoding
 Physical Review E
"... (received; accepted) PACS. 89.90+n – Other areas of general interest to physicists. PACS. 89.70+c – Information science. PACS. 05.50+q – Lattice theory and statistics; Ising problems. Abstract. – The performance of “typical set (pairs) decoding ” for ensembles of Gallager’s linear code is investigat ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(received; accepted) PACS. 89.90+n – Other areas of general interest to physicists. PACS. 89.70+c – Information science. PACS. 05.50+q – Lattice theory and statistics; Ising problems. Abstract. – The performance of “typical set (pairs) decoding ” for ensembles of Gallager’s linear code
Statistical Comparisons of Classifiers over Multiple Data Sets
, 2006
"... While methods for comparing two learning algorithms on a single data set have been scrutinized for quite some time already, the issue of statistical tests for comparisons of more algorithms on multiple data sets, which is even more essential to typical machine learning studies, has been all but igno ..."
Abstract

Cited by 716 (0 self)
 Add to MetaCart
While methods for comparing two learning algorithms on a single data set have been scrutinized for quite some time already, the issue of statistical tests for comparisons of more algorithms on multiple data sets, which is even more essential to typical machine learning studies, has been all
On Large Deviation Analysis of Sampling from Typical Sets
, 2007
"... Consider a pair of correlated sources (X, Y). With the collection of typical sequences of X and Y, one can associate a nearly semiregular bipartite graph. The typical sequences of X and Y form vertices, and two sequences are connected by an edge if they are jointly typical. In this work, we study ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Consider a pair of correlated sources (X, Y). With the collection of typical sequences of X and Y, one can associate a nearly semiregular bipartite graph. The typical sequences of X and Y form vertices, and two sequences are connected by an edge if they are jointly typical. In this work, we
Where the typical set partitions meet and join
 Electronic Journal of Combinatorics
"... Abstract. The lattice of the set partitions of [n] ordered by refinement is studied. Suppose r partitions p1,...,pr are chosen independently and uniformly at random. The probability that the coarsest refinement of all pi ’s is the finest partition {1},...,{n} is shown to approach 0 for r =2,and1for ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. The lattice of the set partitions of [n] ordered by refinement is studied. Suppose r partitions p1,...,pr are chosen independently and uniformly at random. The probability that the coarsest refinement of all pi ’s is the finest partition {1},...,{n} is shown to approach 0 for r =2,and1for
On Large Deviation Analysis of Sampling from Typical Sets
"... Abstract — Consider a pair of correlated sources (X, Y).With the collection of typical sequences of X and Y, one can associate a nearly semiregular bipartite graph. The typical sequences of X and Y form vertices, and two sequences are connected by an edge if they are jointly typical. In this work, ..."
Abstract
 Add to MetaCart
Abstract — Consider a pair of correlated sources (X, Y).With the collection of typical sequences of X and Y, one can associate a nearly semiregular bipartite graph. The typical sequences of X and Y form vertices, and two sequences are connected by an edge if they are jointly typical. In this work
The pyramid match kernel: Discriminative classification with sets of image features
 IN ICCV
, 2005
"... Discriminative learning is challenging when examples are sets of features, and the sets vary in cardinality and lack any sort of meaningful ordering. Kernelbased classification methods can learn complex decision boundaries, but a kernel over unordered set inputs must somehow solve for correspondenc ..."
Abstract

Cited by 546 (29 self)
 Add to MetaCart
Discriminative learning is challenging when examples are sets of features, and the sets vary in cardinality and lack any sort of meaningful ordering. Kernelbased classification methods can learn complex decision boundaries, but a kernel over unordered set inputs must somehow solve
A Set Of Principles For Conducting And Evaluating Interpretive Field Studies In Information Systems
, 1999
"... This article discusses the conduct and evaluation of interpretive research in information systems. While the conventions for evaluating information systems case studies conducted according to the natural science model of social science are now widely accepted, this is not the case for interpretive f ..."
Abstract

Cited by 874 (5 self)
 Add to MetaCart
field studies. A set of principles for the conduct and evaluation of interpretive field research in information systems is proposed, along with their philosophical rationale. The usefulness of the principles is illustrated by evaluating three published interpretive field studies drawn from
Shape modeling with front propagation: A level set approach
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1995
"... Abstract Shape modeling is an important constituent of computer vision as well as computer graphics research. Shape models aid the tasks of object representation and recognition. This paper presents a new approach to shape modeling which retains some of the attractive features of existing methods ..."
Abstract

Cited by 804 (20 self)
 Add to MetaCart
secting, hypersurface flowing along its gradient field with constant speed or a speed that depends on the curvature. It is moved by solving a “HamiltonJacob? ’ type equation written for a function in which the interface is a particular level set. A speed term synthesizpd from the image is used to stop the interface
Results 1  10
of
2,884,320