Results 1  10
of
5,225
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
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
The Active Badge Location System
 ACM Transactions on Information Systems
, 1992
"... cation is the `pager system'. In order to locate a person a signal is sent out by a central facility that addresses a particular receiver unit (beeper) and produces an audible signal. In addition, it may display a number to which the calledparty should phone back (some systems allow a vocal me ..."
Abstract

Cited by 1488 (15 self)
 Add to MetaCart
cation is the `pager system'. In order to locate a person a signal is sent out by a central facility that addresses a particular receiver unit (beeper) and produces an audible signal. In addition, it may display a number to which the calledparty should phone back (some systems allow a vocal
ªThe Breakup of Nations: A Political Economy Analysis,º ECARE Discussion paper
, 1994
"... This paper develops a model of the breakup or uni®cation of nations. In each nation the decision to separate is taken by majority voting. A basic tradeoff between the ef®ciency gains of uni®cation and the costs in terms of loss of control on political decisions is highlighted. The model emphasizes ..."
Abstract

Cited by 224 (0 self)
 Add to MetaCart
This paper develops a model of the breakup or uni®cation of nations. In each nation the decision to separate is taken by majority voting. A basic tradeoff between the ef®ciency gains of uni®cation and the costs in terms of loss of control on political decisions is highlighted. The model
The probability of duplicate gene preservation by subfunctionalization.
 Genetics
, 2000
"... ABSTRACT It has often been argued that geneduplication events are most commonly followed by a mutational event that silences one member of the pair, while on rare occasions both members of the pair are preserved as one acquires a mutation with a beneficial function and the other retains the origin ..."
Abstract

Cited by 261 (2 self)
 Add to MetaCart
; Wendel 1999). The high degree of duplicategene chromosomal regions or entire chromosomes, or gepreservation observed for genome duplication events nomewide events that result in complete genome dupli(commonly on the order of 2050%) for such long cation (polyploidization). Because gene duplicates
Realtime logics: complexity and expressiveness
 INFORMATION AND COMPUTATION
, 1993
"... The theory of the natural numbers with linear order and monadic predicates underlies propositional linear temporal logic. To study temporal logics that are suitable for reasoning about realtime systems, we combine this classical theory of in nite state sequences with a theory of discrete time, via ..."
Abstract

Cited by 252 (16 self)
 Add to MetaCart
The theory of the natural numbers with linear order and monadic predicates underlies propositional linear temporal logic. To study temporal logics that are suitable for reasoning about realtime systems, we combine this classical theory of in nite state sequences with a theory of discrete time, via
Higher Order Logic Programming with Untyped Lambda Expressions
"... Abstract. A higher order logic programming system is presented. The declarative semantics of the system is based on the typefree higher order logic NaDSyL, which takes a nominalist approach to solving the settheoretic paradoxes. The operational semantics is based on the deterministic and useful su ..."
Abstract
 Add to MetaCart
subset of higher order uni cation known as pattern uni cation. It is shown that the system allows all expressions of the untyped lambda calculus, including the Y combinator and expressions capturing recursive functions, without losing consistency due to Curry's paradox. The system automatically
HighOrder Collocation Methods for Differential Equations with Random Inputs
 SIAM Journal on Scientific Computing
"... Abstract. Recently there has been a growing interest in designing efficient methods for the solution of ordinary/partial differential equations with random inputs. To this end, stochastic Galerkin methods appear to be superior to other nonsampling methods and, in many cases, to several sampling met ..."
Abstract

Cited by 188 (13 self)
 Add to MetaCart
Carlo methods, are straightforward to implement, but they do not offer convergence as fast as stochastic Galerkin methods. In this paper, a highorder stochastic collocation approach is proposed. Similar to stochastic Galerkin methods, the collocation methods take advantage of an assumption
Comparison of algorithms that select features for pattern classifiers
 Pattern Recognition
, 2000
"... A comparative study of algorithms for largescale feature selection (where the number of features is over 50) is carried out. In the study, the goodness of a feature subset is measured by leaveoneout correctclassi"cation rate of a nearestneighbor (1NN) classi"er and many practical prob ..."
Abstract

Cited by 207 (0 self)
 Add to MetaCart
A comparative study of algorithms for largescale feature selection (where the number of features is over 50) is carried out. In the study, the goodness of a feature subset is measured by leaveoneout correctclassi"cation rate of a nearestneighbor (1NN) classi"er and many practical
Probabilistic Symbolic Model Checking with PRISM: A Hybrid Approach
 International Journal on Software Tools for Technology Transfer (STTT
, 2002
"... In this paper we introduce PRISM, a probabilistic model checker, and describe the ecient symbolic techniques we have developed during its implementation. PRISM is a tool for analysing probabilistic systems. It supports three models: discretetime Markov chains, continuoustime Markov chains and ..."
Abstract

Cited by 207 (32 self)
 Add to MetaCart
and Markov decision processes. Analysis is performed through model checking speci cations in the probabilistic temporal logics PCTL and CSL. Motivated by the success of model checkers such as SMV, which use BDDs (binary decision diagrams), we have developed an implementation of PCTL and CSL model
NarrowingBased Constraint Solving for the Verification of Security Protocols
, 2004
"... We investigate the resolution of a class of symbolic constraints modulo an equational theory presented by a convergent rewriting system. These constraints are combinations of rstorder equations and socalled intruder constraints which can be seen as restricted secondorder uni cation problems. ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We investigate the resolution of a class of symbolic constraints modulo an equational theory presented by a convergent rewriting system. These constraints are combinations of rstorder equations and socalled intruder constraints which can be seen as restricted secondorder uni cation problems
Results 1  10
of
5,225