Secure Short-Key Cryptosystems: Forty Bits is Enough (2007)
Samuel R. Buss, Peter N. Yianilos
This paper introduces a method of implementing secure cryptosystems which use short secret keys, as short as 40 bits or less. The use of short keys has the advantage that keys can be readily...
Ingemar J. Cox, Matt L. Miller, Thomas P. Minka, Thomas V. Papathomas, Peter N. Yianilos, Senior Member, ...
Abstract—This paper presents the theory, design principles, implementation, and performance results of PicHunter, a prototype content-based image retrieval (CBIR) system that has been developed...
Ingemar J. Cox, Matt L. Miller, Thomas P. Minka, Thomas V. Papathomas, Peter N. Yianilos
Abstract--This paper presents the theory, design principles, implementation, and performance results of PicHunter, a prototype content-based image retrieval (CBII) system that has been developed over...
Locally lifting the curse of dimensionality for nearest neighbor search (2000)
Peter N. Yianilos, Extended Abstract
We consider the problem of nearest neighbor search in the Euclidean hypercube [ 1; +1]
The Bayesian Image Retrieval System, PicHunter (2000)
Ingemar J. Cox, Matt L. Miller, Thomas P. Minka, Thomas V. Papathomas, Peter N. Yianilos
This paper presents the theory, design principles, implementation, and performance results of PicHunter, a prototype content-based image retrieval (CBIR) system that has been developed over the past...
Excluded middle vantage point forests for nearest neighbor search (1999)
The excluded middle vantage point forest is a new data structure that supports worst case sublinear time searches in a metric space for nearest neighbors within a xed radius of arbitrary queries....
Secure Short-Key Cryptosystems: Forty Bits is Enough (1999)
Samuel R. Buss, Peter N. Yianilos
This paper discusses the use of short secret keys, as short as 40 bits or fewer, to implement secure public and private key cryptosystems. Short keys are readily memorized and do not need to be...
An Optimized Interaction Strategy for Bayesian Relevance Feedback (1998)
Ingemar J. Cox, Matthew L. Miller, Thomas P. Minka, Peter N. Yianilos
A new algorithm and systematic evaluation is presented for searching a database via relevance feedback. It represents a new image display strategy for the PicHunter system [2, 1]. The algorithm takes...
Towards an archival Intermemory (1998)
Andrew V. Goldberg, Peter N. Yianilos
We propose a self-organizing archival Intermemory. That is, a noncommercial subscriber-provided distributed information storage service built on the existing Internet. Given an assumption of...
Towards EM-style Algorithms for Posterior Optimization of Normal Mixtures (1998)
Eric Sven Ristad, Peter N. Yianilos
Expectation maximization (EM) provides a simple and elegant approach to the problem of optimizing the parameters of a normal mixture on an unlabeled dataset. To accomplish this, EM iteratively...
A Surficial Pronunciation Model (1998)
Eric Sven Ristad, Peter N. Yianilos
We argue for a surficial pronunciation model: a model without underlying forms. The surficial model outperforms a traditional generative model by a significant margin on conversational speech...
An Optimized Interaction Strategy for Bayesian Relevance Feedback (1998)
Ingemar Cox, Matthew L. Miller, Thomas P. Minka, Peter N. Yianilos
A new algorithm and systematic evaluation is presented for searching a database via relevance feedback. It represents a new image display strategy for the PicHunter system [2, 1]. The algorithm takes...
An Optimized Interaction Strategy for Bayesian Relevance Feedback (1998)
Ingemar J. Cox, Matthew L. Miller, Thomas P. Minka, Peter N. Yianilos
A new algorithm and systematic evaluation is presented for searching a database via relevance feedback. It represents a new image display strategy for the PicHunter system [2, 1]. The algorithm takes...
Leonid Gurvits, Peter N. Yianilos
) August 13, 1998 Abstract The deflation-inflation convex optimization method is introduced. One result is a simple and practical approximation algorithm for the max cut problem based on the...
Samuel R. Buss, Peter N. Yianilos
This paper introduces a method of implementing secure cryptosystems which use short secret keys, as short as 40 bits or less. The use of short keys has the advantage that keys can be readily...
Learning string edit distance (1998)
Eric Sven Ristad, Peter N. Yianilos, Senior Member
Abstract—In many applications, it is necessary to determine the similarity of two strings. A widely-used notion of string similarity is the edit distance: The minimum number of insertions,...
Library of Practical Abstractions, Release 1.2 (1997)
Ristad, Eric Sven, Yianilos, Peter N.
The library of practical abstractions (LIBPA) provides efficient implementations of conceptually simple abstractions, in the C programming language. We believe that the best library code is...
Hidden annotation in content based image retrieval (1997)
Ingemar J. Cox, Thomas V. Papathomas, Joumana Ghosn, Peter N. Yianilos, Matt L. Miller
The Bayesian relevance-feedback approach introduced with the PicHunter system [5] is extended to include hidden semantic attributes. The general approach is motivated and experimental results are...
Significantly lower entropy estimates for natural DNA sequences (1997)
David M. Loewenstern, Peter N. Yianilos
If DNA were a random string over its alphabet fA; C; G; Tg, an optimal code would assign 2 bits to each nucleotide. We imagine DNA to be a highly ordered, purposeful molecule, and might therefore...
Towards EM-style Algorithms for a posteriori Optimization of Normal Mixtures (1997)
Eric S. Ristad, Peter N. Yianilos
Expectation maximization (EM) provides a simple and elegant approach to the problem of optimizing the parameters of a normal mixture on an unlabeled dataset. To accomplish this, EM iteratively...
Eric Sven, Eric Sven Ristad, Peter N. Yianilos
Finite growth models (FGM) are nonnegative functionals that arise from parametricallyweighted directed acyclic graphs and a tuple observation that affects these weights. The weight of a source-sink...
Learning String Edit Distance (1997)
Eric Sven, Eric Sven Ristad, Peter N. Yianilos
In many applications, it is necessary to determine the similarity of two strings. A widely-used notion of string similarity is the edit distance: the minimum number of insertions, deletions, and...
Hidden Annotation in Content Based Image Retrieval (1997)
Ingemar J. Cox, Thomas V. Papathomas, Joumana Ghosn, Peter N. Yianilos, Matt L. Miller
The Bayesian relevance-feedback approach introduced with the PicHunter system [5] is extended to include hidden semantic attributes. The general approach is motivated and experimental results are...
Learning String Edit Distance (1997)
Eric Sven, Eric Sven Ristad, Peter N. Yianilos
In many applications, it is necessary to determine the similarity of two strings. A widely-used notion of string similarity is the edit distance: the minimum number of insertions, deletions, and...
Learning String Edit Distance (1997)
Eric Sven Ristad, Peter N. Yianilos, Peter N
In many applications, it is necessary to determine the similarity of two strings. A widely-used notion of string similarity is the edit distance: the minimum number of insertions, deletions, and...
The LikeIt Intelligent String Comparison Facility (1997)
Peter N. Yianilos, Kirk G. Kanzelberger
A highly-efficient ANSI-C facility is described for intelligently comparing a query string with a series of database strings. The bipartite weighted matching approach taken tolerates ordering...
Topics In Computational Hidden State Modeling (1997)
Motivated by the goal of establishing stochastic and information theoretic foundations for the study of intelligence and synthesis of intelligent machines, this thesis probes several topics relating...
Learning string edit distance (1996)
Ristad, Eric Sven, Yianilos, Peter N.
In many applications, it is necessary to determine the similarity of two strings. A widely-used notion of string similarity is the edit distance: the minimum number of insertions, deletions, and...
Target testing and the PicHunter bayesian multimedia retrieval system (1996)
Ingemar J. Cox, Matt L. Miller, Stephen M. Omohundro, Peter N. Yianilos
This paper addresses how the effectiveness of a contentbased, multimedia information retrieval system can be measured, and how such a system should best use response feedback in performing searches....
Significantly Lower Entropy Estimates for Natural DNA Sequences (1996)
David Loewenstern, Peter N. Yianilos
If DNA were a random string over its alphabet fA; C; G; Tg, an optimal code would assign 2 bits to each nucleotide. DNA may be imagined to be a highly ordered, purposeful molecule, and one might...
Feature-Based Face Recognition Using Mixture-Distance (1996)
Ingemar Cox, Joumana Ghosn, Peter N. Yianilos
We consider the problem of feature-based face recognition in the setting where only a single example of each face is available for training. The mixture-distance technique we introduce achieves a...
Bayesian Relevance Feedback for Image Retrieval (1996)
Ingemar J. Cox, Matt L. Miller, Stephen M. Omohundro, Peter N. Yianilos
This paper 1 describes PicHunter, an image retrieval system that implements a novel approach to relevance feedback, such that the entire history of user selections contributes to the system's...
Eric S. Ristad, Peter N. Yianilos
This short paper illuminates certain fundamental aspects of the nature of normal (Gaussian) mixtures. Thinking of each mixture component as a class, we focus on the corresponding a posteriori class...
Finite Growth Models and the Learning of Edit Distance Costs (1996)
Eric Sven Ristad, Peter N. Yianilos
We introduce finite growth models (FGMs) and apply them to the problem of learning optimal costs for string edit distance. We present the first algorithm that learns the optimal insertion, deletion...
Feature-Based Face Recognition Using Mixture-Distance (1996)
Ingemar Cox, Joumana Ghosn, Peter N. Yianilos
We consider the problem of feature-based face recognition in the setting where only a single example of each face is available for training. The mixture-distance technique we introduce achieves a...
Significantly Lower Entropy Estimates for Natural DNA Sequences (1996)
David Loewenstern, Peter N. Yianilos
If DNA were a random string over its alphabet fA; C; G; Tg, an optimal code would assign 2 bits to each nucleotide. DNA may be imagined to be a highly ordered, purposeful molecule, and one might...
Metric Learning via Normal Mixtures (1995)
Peter Yianilos October, Peter N. Yianilos
Natural learners rarely have access to perfectly labeled data -- motivating the study of unsupervised learning in an attempt to assign labels. An alternative viewpoint, which avoids the issue of...
Linear and O(n log n) Time Minimum-Cost Matching Algorithms for Quasi-convex Tours (1995)
Samuel R. Buss, Peter N. Yianilos
Let G be a complete, weighted, undirected, bipartite graph with n red nodes, n 0 blue nodes, and symmetric cost function c(x; y) . A maximum matching for G consists of minfn; n 0 g edges from...
A Bipartite Matching Approach to Approximate String Comparison and Search (1995)
Samuel R. Buss, Peter N. Yianilos
Approximate string comparison and search is an important part of applications that range from natural language to the interpretation of DNA. This paper presents a bipartite weighted graph matching...
Value Library Peter, Peter N. Yianilos, Eric Sven Ristad
Hidden Markov models (HMMs) and other time series models assign probabilities to long sequences of events. Avoiding underflow is arguably the central difficulty in calculating the probability of such...
Linear and O(n log n) time minimum-cost matching algorithms for quasi-convex tours (1994)
Samuel R. Buss, Peter N. Yianilos
Let G be a complete, weighted, undirected, bipartite graph with n red nodes, n # blue nodes, and symmetric cost function c(x, y). A maximum matching for G consists of min{n, n # edges from distinct...
Probability Value Library (1994)
Peter N. Yianilos, Eric Sven Ristad
Hidden Markov models (HMMs) and other time series models assign probabilities to long sequences of events. Avoiding underflow is arguably the central difficulty in calculating the probability of such...
Samuel R. Buss, Kirk G. Kanzelberger, David Robinson, Peter N. Yianilos
We report an efficient and highly portable ANSI C implementation of the Buss-Yianilos minimum-cost matching algorithm for quasi-convex tours. A generic O(log n) time implementation of the...
Linear and O(n log n) Time Minimum-Cost Matching Algorithms for Quasi-convex Tours (1994)
Samuel R. Buss, Peter N. Yianilos
Let G be a complete, weighted, undirected, bipartite graph with n red nodes, n 0 blue nodes, and symmetric cost function c(x, y). A maximum matching for G consists of minfn; n 0 g edges from distinct...
and O(n log n) time minimum-cost matching algorithms for quasi-convex tours (1994)
Samuel R. Buss, Peter N. Yianilos
Let G be a complete, weighted, undirected, bipartite graph with n red nodes, n ′ blue nodes, and symmetric cost function c(x, y). A maximum matching for G consists of min{n, n ′ } edges from...
Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces (1993)
Peter Yianil Os, Peter N. Yianilos
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximated in Euclidian...
Normalized forms for two common metrics (1991)
Abstract--- In this paper we demonstrate that two common metrics, symmetric set difference, and Euclidian distance, have normalized forms which are nevertheless metrics. The first of these...