Results 1  10
of
600
Bayesian inference on phylogeny and its impact on evolutionary biology.
 Science
, 2001
"... 1 As a discipline, phylogenetics is becoming transformed by a flood of molecular data. These data allow broad questions to be asked about the history of life, but also present difficult statistical and computational problems. Bayesian inference of phylogeny brings a new perspective to a number of o ..."
Abstract

Cited by 235 (10 self)
 Add to MetaCart
in purifying or positively selected class; sample substitutions and count number of synonymous and nonsynonymous changes Divergence times Use fossils as a calibration. Infer divergence times by using a strict or relaxed molecular clock Testing molecular clock Calculate Bayes factor for the clock versus
Very Strict Selectional Restrictions: A Comparison Between Portuguese and French *
"... We discuss the characteristics and behaviour of two parallel classes of verbs in two ..."
Abstract
 Add to MetaCart
We discuss the characteristics and behaviour of two parallel classes of verbs in two
Classifying the complexity of constraints using finite algebras
 SIAM Journal on Computing
, 2005
"... Abstract. Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NPcomplete in general, but certain restrictions on the form of the constraints can ensure tractability. Here we show that any set of relations used to specify th ..."
Abstract

Cited by 181 (33 self)
 Add to MetaCart
Abstract. Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NPcomplete in general, but certain restrictions on the form of the constraints can ensure tractability. Here we show that any set of relations used to specify
1 Very strict selectional restrictions: a comparison between Portuguese and French
"... We discuss the characteristics and behaviour of two parallel classes of verbs in two Romance languages, French and Portuguese. Examples of these verbs are Port. abater [gado] and Fr. abattre [bétail], both meaning ‘slaughter [cattle]’. Such collocations are intermediate cases between verbal idioms a ..."
Abstract
 Add to MetaCart
We discuss the characteristics and behaviour of two parallel classes of verbs in two Romance languages, French and Portuguese. Examples of these verbs are Port. abater [gado] and Fr. abattre [bétail], both meaning ‘slaughter [cattle]’. Such collocations are intermediate cases between verbal idioms
Approximation algorithms for combinatorial auctions with complementfree bidders
 In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC
, 2005
"... We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in the number of items m and in the number of bidders n, even though the “input size ” is exponential in m. The first algori ..."
Abstract

Cited by 133 (25 self)
 Add to MetaCart
algorithm provides an O(log m) approximation. The second algorithm provides an O ( √ m) approximation in the weaker model of value oracles. This algorithm is also incentive compatible. The third algorithm provides an improved 2approximation for the more restricted case of “XOS bidders”, a class which
Anatomy of the chase
"... A lot of research activity has recently taken place around the chase procedure, due to its usefulness in data integration, data exchange, query optimization, peer data exchange and data correspondence, to mention a few. As the chase has been investigated and further developed by a number of researc ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
dependent REcompleteness result as a byproduct. For one of the restricted classes, the stratified sets dependencies, we provide new complexity results for the problem of testing whether a given set of dependencies belongs to it. These results rectify some previous claims that have occurred in the literature.
Revisiting trace and testing equivalences for nondeterministic and probabilistic processes
 In Proc. of the 15th Int. Conf. on Foundations of Software Science and Computation Structures (FOSSACS 2012), volume 7213 of LNCS
, 2012
"... Abstract. Two of the most studied extensions of trace and testing equivalences to nondeterministic and probabilistic processes induce distinctions that have been questioned and lack properties that are desirable. Probabilistic tracedistribution equivalence differentiates systems that can perform ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
the same set of traces with the same probabilities, and is not a congruence for parallel composition. Probabilistic testing equivalence, which relies only on extremal success probabilities, is backward compatible with testing equivalences for restricted classes of processes, such as fully nondeterministic
Multimodal biometrics: an overview
 Proc. of 12th European Signal Processing Conference (EUSIPCO
, 2004
"... Unimodal biometric systems have to contend with a variety of problems such as noisy data, intraclass variations, restricted degrees of freedom, nonuniversality, spoof attacks, and unacceptable error rates. Some of these limitations can be addressed by deploying multimodal biometric systems that ..."
Abstract

Cited by 94 (0 self)
 Add to MetaCart
Unimodal biometric systems have to contend with a variety of problems such as noisy data, intraclass variations, restricted degrees of freedom, nonuniversality, spoof attacks, and unacceptable error rates. Some of these limitations can be addressed by deploying multimodal biometric systems
The Origin of Power Laws in Internet Topologies Revisited
 In IEEE INFOCOM 2002
, 2002
"... In a recent paper, Faloutsos et al. [1] found that the inter Autonomous System (AS) topology exhibits a powerlaw vertex degree distribution. This result was quite unexpected in the networking community and stirred significant interest in exploring the possible causes of this phenomenon. The work of ..."
Abstract

Cited by 109 (3 self)
 Add to MetaCart
of Barabasi and Albert [2] and its application to network topology generation in the work of Medina et al. [3] have explored a promising class of models that yield strict powerlaw vertex degree distributions. In this paper, we reexamine the BGP measurements that form the basis for the results reported in [1
Monopole classes and Einstein metrics
 Int. Math. Res. Notices
"... ABSTRACT. We introduce the notion of a special monopole class on a fourmanifold. This is used to prove restrictions on the smooth structures of Einstein manifolds. As an application we prove that there are Einstein fourmanifolds which are simply connected, spin, and satisfy the strict Hitchin–Thor ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
ABSTRACT. We introduce the notion of a special monopole class on a fourmanifold. This is used to prove restrictions on the smooth structures of Einstein manifolds. As an application we prove that there are Einstein fourmanifolds which are simply connected, spin, and satisfy the strict Hitchin
Results 1  10
of
600