Results 1  10
of
1,495
Scalable Distributed Reasoning using MapReduce
"... We address the problem of scalable distributed reasoning, proposing a technique for materialising the closure of an RDF graph based on MapReduce. We have implemented our approach on top of Hadoop and deployed it on a compute cluster of up to 64 commodity machines. We show that a naive implementatio ..."
Abstract

Cited by 93 (14 self)
 Add to MetaCart
implementation on top of MapReduce is straightforward but performs badly and we present several nontrivial optimisations. Our algorithm is scalable and allows us to compute the RDFS closure of 865M triples from the Web (producing 30B triples) in less than two hours, faster than any other published approach.
A tutorial on support vector machines for pattern recognition
 Data Mining and Knowledge Discovery
, 1998
"... The tutorial starts with an overview of the concepts of VC dimension and structural risk minimization. We then describe linear Support Vector Machines (SVMs) for separable and nonseparable data, working through a nontrivial example in detail. We describe a mechanical analogy, and discuss when SV ..."
Abstract

Cited by 3393 (12 self)
 Add to MetaCart
The tutorial starts with an overview of the concepts of VC dimension and structural risk minimization. We then describe linear Support Vector Machines (SVMs) for separable and nonseparable data, working through a nontrivial example in detail. We describe a mechanical analogy, and discuss when
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
not converge (toyQMR with small priors and real QMR), we found that momentum significantly reduced the chance of oscillation. However, in several cases the beliefs to which the algorithm converged were quite inaccuratesee Discussion The experimental results presented here suggest that loopy propagation can
Scalable Distributed Reasoning using
"... Abstract. We address the problem of scalable distributed reasoning, proposing a technique for materialising the closure of an RDF graph (under the RDFS and OWL Horst semantics) based on MapReduce. We have implemented our approach on top of Hadoop and deployed it on a compute cluster of up to 64 comm ..."
Abstract
 Add to MetaCart
commodity machines. We show that a naive implementation on top of MapReduce is straightforward but performs badly and we present several nontrivial optimisations. Our algorithm is scalable and allows us to compute the RDFS closure of 865M triples from the Web (producing 30B triples) in less than two hours
ControlFlow Analysis of HigherOrder Languages
, 1991
"... representing the official policies, either expressed or implied, of ONR or the U.S. Government. Keywords: dataflow analysis, Scheme, LISP, ML, CPS, type recovery, higherorder functions, functional programming, optimising compilers, denotational semantics, nonstandard Programs written in powerful, ..."
Abstract

Cited by 365 (10 self)
 Add to MetaCart
at compile time. I give examples of how this information can be used to perform several dataflow analysis optimisations, including copy propagation, inductionvariable elimination, uselessvariable elimination, and type recovery. The analysis is defined in terms of a nonstandard semantic interpretation
A New Proof that Alternating Links are NonTrivial
, 2008
"... We use a simple geometric argument and small cancellation properties of link groups to prove that alternating links are nontrivial. Unlike most other proofs of this result, this proof uses only classic results in topology and combinatorial group theory. 1 Statement of Results A link is said to be t ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
alternately. An alternating link is a link that admits an alternating diagram. After a straightforward normalization, an alternating diagram represents a nontrivial link if and only if it contains crossings. We provide a new proof of this result here. There are several approaches in the literature
Ontologybased data access using rewriting, OWL 2 RL systems and repairing
 In: Proceedings of the 11th European Semantic Web Conference (ESWC
, 2014
"... Abstract. In previous work it has been shown how an OWL 2 DL ontology O can be `repaired ' for an OWL 2 RL system ansthat is, how we can compute a set of axioms R that is independent from the data and such that ans that is generally incomplete for O becomes complete for all SPARQL queries whe ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
investigate repairing as an approach to scalable (and complete) ontologybased data access. First, we present several nontrivial optimisations to the rst prototype. Second, we show how (arbitrary) conjunctive queries can be supported by integrating wellknown query rewriting techniques with OWL 2 RL sys
Detecting Causal Relationships in Distributed Computations: In Search of the Holy Grail
 IN SEARCH OF THE HOLY GRAIL. DISTRIBUTED COMPUTING
, 1994
"... The paper shows that characterizing the causal relationship between significant events is an important but nontrivial aspect for understanding the behavior of distributed programs. An introduction to the notion of causality and its relation to logical time is given; some fundamental results concern ..."
Abstract

Cited by 230 (3 self)
 Add to MetaCart
The paper shows that characterizing the causal relationship between significant events is an important but nontrivial aspect for understanding the behavior of distributed programs. An introduction to the notion of causality and its relation to logical time is given; some fundamental results
Genetic programming: Biologically inspired computation that exhibits creativity in solving nontrivial problems
 In Proceedings of the AISBâ€™99 Symposium on Scientific Creativity
, 1999
"... This paper describes a biologically inspired domainindependent technique, called genetic programming, that automatically creates computer programs to solve problems. We argue that the field of design is a useful testbed for determining whether an automated technique can produce results that are com ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
that are competitive with humanproduced results. We present several results that are competitive with the products of human creativity and inventiveness. This claim is supported by the fact that each of the results infringe on previously issued patents. This paper presents a candidate set of criteria that identify
Improved bounds for mixing rates of Markov chains and multicommodity flow
 Combinatorics, Probability and Computing
, 1992
"... The paper is concerned with tools for the quantitative analysis of finite Markov chains whose states are combinatorial structures. Chains of this kind have algorithmic applications in many areas, including random sampling, approximate counting, statistical physics and combinatorial optimisation. The ..."
Abstract

Cited by 205 (8 self)
 Add to MetaCart
The paper is concerned with tools for the quantitative analysis of finite Markov chains whose states are combinatorial structures. Chains of this kind have algorithmic applications in many areas, including random sampling, approximate counting, statistical physics and combinatorial optimisation
Results 1  10
of
1,495