Results 1  10
of
3,170,175
Standard Example
, 2005
"... Why link R with C • Access to compiled routines already written in C (or Fortran). No need to reinvent the wheel! • Speed For loops in R can slow down your program dramatically “Applytype ” functions in R (e.g. apply, lapply, tapply…) are possible ways to circumvent using For loops. However, not ..."
Abstract
 Add to MetaCart
Why link R with C • Access to compiled routines already written in C (or Fortran). No need to reinvent the wheel! • Speed For loops in R can slow down your program dramatically “Applytype ” functions in R (e.g. apply, lapply, tapply…) are possible ways to circumvent using For loops. However, not always possible to avoid them. Writing the slow parts of an R program in C (even inefficiently) can significantly improve the speed / performance of your program • I have used this feature for writing EM type programs
Manifold regularization: A geometric framework for learning from labeled and unlabeled examples
 JOURNAL OF MACHINE LEARNING RESEARCH
, 2006
"... We propose a family of learning algorithms based on a new form of regularization that allows us to exploit the geometry of the marginal distribution. We focus on a semisupervised framework that incorporates labeled and unlabeled data in a generalpurpose learner. Some transductive graph learning al ..."
Abstract

Cited by 576 (16 self)
 Add to MetaCart
algorithms and standard methods including Support Vector Machines and Regularized Least Squares can be obtained as special cases. We utilize properties of Reproducing Kernel Hilbert spaces to prove new Representer theorems that provide theoretical basis for the algorithms. As a result (in contrast to purely
Pregel: A system for largescale graph processing
 IN SIGMOD
, 2010
"... Many practical computing problems concern large graphs. Standard examples include the Web graph and various social networks. The scale of these graphs—in some cases billions of vertices, trillions of edges—poses challenges to their efficient processing. In this paper we present a computational model ..."
Abstract

Cited by 492 (0 self)
 Add to MetaCart
Many practical computing problems concern large graphs. Standard examples include the Web graph and various social networks. The scale of these graphs—in some cases billions of vertices, trillions of edges—poses challenges to their efficient processing. In this paper we present a computational
MACROECONOMICS AND REALITY
 ECONOMETRICA
, 1980
"... Existing strategies for econometric analysis related to macroeconomics are subject to a number of serious objections, some recently formulated, some old. These objections are summarized in this paper, and it is argued that taken together they make it unlikely that macroeconomic models are in fact ov ..."
Abstract

Cited by 796 (1 self)
 Add to MetaCart
over identified, as the existing statistical theory usually assumes. The implications of this conclusion are explored, and an example of econometric work in a nonstandard style, taking account of the objections to the standard style, is presented.
A semantics of multiple inheritance
 Information and Computation
, 1988
"... There are two major ways of structuring data in programming languages. The first and common one, used for example in Pascal, can be said to derive from standard branches of mathematics. Data is organized as cartesian products (i.e. record types), disjoint sums (i.e. unions or variant types) and func ..."
Abstract

Cited by 528 (9 self)
 Add to MetaCart
There are two major ways of structuring data in programming languages. The first and common one, used for example in Pascal, can be said to derive from standard branches of mathematics. Data is organized as cartesian products (i.e. record types), disjoint sums (i.e. unions or variant types
Learning Stochastic Logic Programs
, 2000
"... Stochastic Logic Programs (SLPs) have been shown to be a generalisation of Hidden Markov Models (HMMs), stochastic contextfree grammars, and directed Bayes' nets. A stochastic logic program consists of a set of labelled clauses p:C where p is in the interval [0,1] and C is a firstorder r ..."
Abstract

Cited by 1193 (81 self)
 Add to MetaCart
order rangerestricted definite clause. This paper summarises the syntax, distributional semantics and proof techniques for SLPs and then discusses how a standard Inductive Logic Programming (ILP) system, Progol, has been modied to support learning of SLPs. The resulting system 1) nds an SLP with uniform
On the control of automatic processes: A parallel distributed processing account of the Stroop effect
 Psychological Review
, 1990
"... Traditional views of automaticity are in need of revision. For example, automaticity otten has been treated as an allornone phenomenon, and traditional ~es have held that automatic processes are independent of attention. Yet recent empirical data suggest that automatic processes are continuous, a ..."
Abstract

Cited by 509 (45 self)
 Add to MetaCart
Traditional views of automaticity are in need of revision. For example, automaticity otten has been treated as an allornone phenomenon, and traditional ~es have held that automatic processes are independent of attention. Yet recent empirical data suggest that automatic processes are continuous
A large mass hierarchy from a small extra dimension
, 1999
"... We propose a new higherdimensional mechanism for solving the hierarchy problem. The weak scale is generated from a large scale of order the Planck scale through an exponential hierarchy. However, this exponential arises not from gauge interactions but from the background metric (which is a slice of ..."
Abstract

Cited by 1077 (3 self)
 Add to MetaCart
of AdS5 spacetime). This mechanism relies on the existence of only a single additional dimension. We demonstrate a simple explicit example of this mechanism with two threebranes, one of which contains the Standard Model fields. The experimental consequences of this scenario are new and dramatic
Results 1  10
of
3,170,175