Results 11 - 20 of 58,534

Graph-based algorithms for Boolean function manipulation

by Randal E. Bryant - IEEE TRANSACTIONS ON COMPUTERS , 1986
"... In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on th ..."
Abstract - Cited by 3526 (46 self) - Add to MetaCart
In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions

Semi-Supervised Learning Using Gaussian Fields and Harmonic Functions

by Xiaojin Zhu , Zoubin Ghahramani, John Lafferty - IN ICML , 2003
"... An approach to semi-supervised learning is proposed that is based on a Gaussian random field model. Labeled and unlabeled data are represented as vertices in a weighted graph, with edge weights encoding the similarity between instances. The learning ..."
Abstract - Cited by 752 (14 self) - Add to MetaCart
An approach to semi-supervised learning is proposed that is based on a Gaussian random field model. Labeled and unlabeled data are represented as vertices in a weighted graph, with edge weights encoding the similarity between instances. The learning

Functional discovery via a compendium of expression profiles.

by Timothy R Hughes , Matthew J Marton , Allan R Jones , Christopher J Roberts , Roland Stoughton , Christopher D Armour , Holly A Bennett , Ernest Coffey , Hongyue Dai , Ross-Macdonald , Yudong D He , Matthew J Kidd , Amy M King , Michael R Meyer , David Slade , Pek Y Lum , Sergey B Stepaniants , Daniel D Shoemaker , Julian Simon , Martin Bard - Cell, , 2000
"... provided that the cellular transcriptional response to frames encode proteins required for sterol metabodisruption of different steps in the same pathway is lism, cell wall function, mitochondrial respiration, or similar, and that there are sufficiently unique transcripprotein synthesis. We also sh ..."
Abstract - Cited by 547 (9 self) - Add to MetaCart
provided that the cellular transcriptional response to frames encode proteins required for sterol metabodisruption of different steps in the same pathway is lism, cell wall function, mitochondrial respiration, or similar, and that there are sufficiently unique transcripprotein synthesis. We also

On a theory of learning with similarity functions

by Maria-florina Balcan, Avrim Blum, Nathan Srebro - In International Conference on Machine Learning , 2006
"... Abstract. Kernel functions have become an extremely popular tool in machine learning, with an attractive theory as well. This theory views a kernel as implicitly mapping data points into a possibly very high dimensional space, and describes a kernel function as being good for a given learning proble ..."
Abstract - Cited by 63 (8 self) - Add to MetaCart
” representations of the data. Therefore, it may be difficult for a domain expert to use the theory to help design an appropriate kernel for the learning task at hand. Moreover, the requirement of positive semi-definiteness may rule out the most natural pairwise similarity functions for the given problem domain

Axiomatization of an exponential similarity function

by Antoine Billot, Itzhak Gilboa, David Schmeidler, Antoine Billot, Itzhak Gilboa, David Schmeidler - Mathematical Social Sciences , 2008
"... An agent is asked to assess a real-valued variable y based on certain characteristics x = (x1,..., xm), and on a database consisting of n observations of (x1,..., xm, y). A possible approach to combine past observations of x and y with the current values of x to generate an assessment of y is simila ..."
Abstract - Cited by 10 (6 self) - Add to MetaCart
axiomatizes, in terms of the prediction yn+1, a similarity function that is a (decreasing) exponential in a norm of the difference between the two vectors compared. 1

VisualSEEk: a fully automated content-based image query system

by John R. Smith, Shih-fu Chang , 1996
"... We describe a highly functional prototype system for searching by visual features in an image database. The VisualSEEk system is novel in that the user forms the queries by diagramming spatial arrangements of color regions. The system finds the images that contain the most similar arrangements of ..."
Abstract - Cited by 762 (31 self) - Add to MetaCart
We describe a highly functional prototype system for searching by visual features in an image database. The VisualSEEk system is novel in that the user forms the queries by diagramming spatial arrangements of color regions. The system finds the images that contain the most similar arrangements

Fastmap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets

by Christos Faloutsos, King-Ip (David) Lin , 1995
"... A very promising idea for fast searching in traditional and multimedia databases is to map objects into points in k-d space, using k feature-extraction functions, provided by a domain expert [Jag91]. Thus, we can subsequently use highly fine-tuned spatial access methods (SAMs), to answer several ..."
Abstract - Cited by 502 (22 self) - Add to MetaCart
A very promising idea for fast searching in traditional and multimedia databases is to map objects into points in k-d space, using k feature-extraction functions, provided by a domain expert [Jag91]. Thus, we can subsequently use highly fine-tuned spatial access methods (SAMs), to answer several

The empirical case for two systems of reasoning

by Steven A. Sloman , 1996
"... Distinctions have been proposed between systems of reasoning for centuries. This article distills properties shared by many of these distinctions and characterizes the resulting systems in light of recent findings and theoretical developments. One system is associative because its computations ref ..."
Abstract - Cited by 669 (4 self) - Add to MetaCart
reflect similarity structure and relations of temporal contiguity. The other is “rule based” because it operates on symbolic structures that have logical content and variables and because its computations have the properties that are normally assigned to rules. The systems serve complementary functions

A Syntactic Approach to Type Soundness

by Andrew K. Wright, Matthias Felleisen - INFORMATION AND COMPUTATION , 1992
"... We present a new approach to proving type soundness for Hindley/Milner-style polymorphic type systems. The keys to our approach are (1) an adaptation of subject reduction theorems from combinatory logic to programming languages, and (2) the use of rewriting techniques for the specification of the la ..."
Abstract - Cited by 629 (22 self) - Add to MetaCart
of the language semantics. The approach easily extends from polymorphic functional languages to imperative languages that provide references, exceptions, continuations, and similar features. We illustrate the technique with a type soundness theorem for the core of Standard ML, which includes the first type

Nonrigid registration using free-form deformations: Application to breast MR images

by D. Rueckert, L. I. Sonoda, C. Hayes, D. L. G. Hill, M. O. Leach, D. J. Hawkes - IEEE Transactions on Medical Imaging , 1999
"... Abstract — In this paper we present a new approach for the nonrigid registration of contrast-enhanced breast MRI. A hierarchical transformation model of the motion of the breast has been developed. The global motion of the breast is modeled by an affine transformation while the local breast motion i ..."
Abstract - Cited by 697 (36 self) - Add to MetaCart
is described by a free-form deformation (FFD) based on B-splines. Normalized mutual information is used as a voxel-based similarity measure which is insensitive to intensity changes as a result of the contrast enhancement. Registration is achieved by minimizing a cost function, which represents a combination
Results 11 - 20 of 58,534