Results 1  10
of
2,144
A comparison of event models for Naive Bayes text classification
, 1998
"... Recent work in text classification has used two different firstorder probabilistic models for classification, both of which make the naive Bayes assumption. Some use a multivariate Bernoulli model, that is, a Bayesian Network with no dependencies between words and binary word features (e.g. Larkey ..."
Abstract

Cited by 1025 (26 self)
 Add to MetaCart
.g. Larkey and Croft 1996; Koller and Sahami 1997). Others use a multinomial model, that is, a unigram language model with integer word counts (e.g. Lewis and Gale 1994; Mitchell 1997). This paper aims to clarify the confusion by describing the differences and details of these two models, and by empirically
On the Convergence of Pattern Search Algorithms
"... . We introduce an abstract definition of pattern search methods for solving nonlinear unconstrained optimization problems. Our definition unifies an important collection of optimization methods that neither computenor explicitly approximate derivatives. We exploit our characterization of pattern sea ..."
Abstract

Cited by 243 (13 self)
 Add to MetaCart
search methods to establish a global convergence theory that does not enforce a notion of sufficient decrease. Our analysis is possible because the iterates of a pattern search method lie on a scaled, translated integer lattice. This allows us to relax the classical requirements on the acceptance
Minos: Control Data Attack Prevention Orthogonal to Memory Model
, 2004
"... We introduce Minos, a microarchitecture that implements Biba's lowwatermark integrity policy on individual words of data. Minos stops attacks that corrupt control data to hijack program control flow but is orthogonal to the memory model. Control data is any data which is loaded into the progr ..."
Abstract

Cited by 202 (16 self)
 Add to MetaCart
We introduce Minos, a microarchitecture that implements Biba's lowwatermark integrity policy on individual words of data. Minos stops attacks that corrupt control data to hijack program control flow but is orthogonal to the memory model. Control data is any data which is loaded
On representations of integers by
"... Let f be an indefinite ternary integral quadratic form and let q be a nonzero integer such that −qdet(f) is not a square. Let N(T, f, q) denote the number of integral solutions of the equation f(x) = q where x lies in the ball of radius T centered at the origin. We are interested in the asymptotic ..."
Abstract
 Add to MetaCart
Let f be an indefinite ternary integral quadratic form and let q be a nonzero integer such that −qdet(f) is not a square. Let N(T, f, q) denote the number of integral solutions of the equation f(x) = q where x lies in the ball of radius T centered at the origin. We are interested in the asymptotic
Efficiency Integer
, 2013
"... This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal noncommercial research and education use, including for instruction at the authors institution and sharing with colleagues. Other uses, including reproduction and distribution, or sel ..."
Abstract
 Add to MetaCart
, or selling or licensing copies, or posting to personal, institutional or third party websites are prohibited. In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information
Word Sense Disambiguation as an Integer Linear Programming Problem
"... Abstract. We present an integer linear programming model of word sense disambiguation. Given a sentence, an inventory of possible senses per word, and a sense relatedness measure, the model assigns to the sentences’s word occurrences the senses that maximize the total pairwise sense relatedness. Exp ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. We present an integer linear programming model of word sense disambiguation. Given a sentence, an inventory of possible senses per word, and a sense relatedness measure, the model assigns to the sentences’s word occurrences the senses that maximize the total pairwise sense relatedness
KEY WORDS AND PHRASES. Diophantine equations, integers.
, 1984
"... ABSTRACT. The Diophantine equation of the title is solved in integers. ..."
REPRESENTATIONS OF THE INTEGERS BY
"... For a fixed base, John H. Conway’s RATS sequences are generated by iterating the following procedure on an initial integer: Reverse the digits of the integer, Add the reversal to the original, Then Sort the resulting digits in increasing order. For example, 334+433=767, which gets sorted into 677. I ..."
Abstract
 Add to MetaCart
For a fixed base, John H. Conway’s RATS sequences are generated by iterating the following procedure on an initial integer: Reverse the digits of the integer, Add the reversal to the original, Then Sort the resulting digits in increasing order. For example, 334+433=767, which gets sorted into 677
A Locally Adaptive Data Compression Scheme
, 1986
"... A data compression scheme that exploits locality of reference, such as occurs when words are used frequently over short intervals and then fall into long periods of disuse, is described. The scheme is based on a simple heuristic for selforganizing sequential search and on variablelength encoding ..."
Abstract

Cited by 173 (2 self)
 Add to MetaCart
A data compression scheme that exploits locality of reference, such as occurs when words are used frequently over short intervals and then fall into long periods of disuse, is described. The scheme is based on a simple heuristic for selforganizing sequential search and on variable
Coil sensitivity encoding for fast MRI. In:
 Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract

Cited by 193 (3 self)
 Add to MetaCart
, must not exceed n C . In other words, the reduction factor is bound by the number of coils used. Note that n P does not need to be the same for all partial unfolding steps. Upon noninteger reduction the number of pixels actually superimposed may vary in the reduced FOV. Generally, the degree
Results 1  10
of
2,144