Results 1  10
of
2,306,727
Learning with local and global consistency
 Advances in Neural Information Processing Systems 16
, 2004
"... We consider the general problem of learning from labeled and unlabeled data, which is often called semisupervised learning or transductive inference. A principled approach to semisupervised learning is to design a classifying function which is sufficiently smooth with respect to the intrinsic stru ..."
Abstract

Cited by 659 (21 self)
 Add to MetaCart
We consider the general problem of learning from labeled and unlabeled data, which is often called semisupervised learning or transductive inference. A principled approach to semisupervised learning is to design a classifying function which is sufficiently smooth with respect to the intrinsic
Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams
 ACM Tmns. Graph
, 1985
"... The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms ar ..."
Abstract

Cited by 532 (11 self)
 Add to MetaCart
The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms
Exact Sampling with Coupled Markov Chains and Applications to Statistical Mechanics
, 1996
"... For many applications it is useful to sample from a finite set of objects in accordance with some particular distribution. One approach is to run an ergodic (i.e., irreducible aperiodic) Markov chain whose stationary distribution is the desired distribution on this set; after the Markov chain has ..."
Abstract

Cited by 537 (13 self)
 Add to MetaCart
has run for M steps, with M sufficiently large, the distribution governing the state of the chain approximates the desired distribution. Unfortunately it can be difficult to determine how large M needs to be. We describe a simple variant of this method that determines on its own when to stop
RangeFree Localization Schemes for Large Scale Sensor Networks
, 2003
"... Wireless Sensor Networks have been proposed for a multitude of locationdependent applications. For such systems, the cost and limitations of hardware on sensing nodes prevent the use of rangebased localization schemes that depend on absolute pointtopoint distance estimates. Because coarse accura ..."
Abstract

Cited by 515 (8 self)
 Add to MetaCart
Wireless Sensor Networks have been proposed for a multitude of locationdependent applications. For such systems, the cost and limitations of hardware on sensing nodes prevent the use of rangebased localization schemes that depend on absolute pointtopoint distance estimates. Because coarse
Distance Metric Learning, With Application To Clustering With SideInformation
 ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 15
, 2003
"... Many algorithms rely critically on being given a good metric over their inputs. For instance, data can often be clustered in many "plausible" ways, and if a clustering algorithm such as Kmeans initially fails to find one that is meaningful to a user, the only recourse may be for the us ..."
Abstract

Cited by 807 (13 self)
 Add to MetaCart
be for the user to manually tweak the metric until sufficiently good clusters are found. For these and other applications requiring good metrics, it is desirable that we provide a more systematic way for users to indicate what they consider "similar." For instance, we may ask them to provide
Constrained model predictive control: Stability and optimality
 AUTOMATICA
, 2000
"... Model predictive control is a form of control in which the current control action is obtained by solving, at each sampling instant, a finite horizon openloop optimal control problem, using the current state of the plant as the initial state; the optimization yields an optimal control sequence and t ..."
Abstract

Cited by 706 (15 self)
 Add to MetaCart
important because efficiency demands operating points on or close to the boundary of the set of admissible states and controls. In this review, we focus on model predictive control of constrained systems, both linear and nonlinear and discuss only briefly model predictive control of unconstrained nonlinear
On µkernel construction
 Symposium on Operating System Principles
, 1995
"... From a softwaretechnology point of view, thekernel concept is superior to large integrated kernels. On the other hand, it is widely believed that (a)kernel based systems are inherently inefficient and (b) they are not sufficiently flexible. Contradictory to this belief, we show and support by doc ..."
Abstract

Cited by 426 (25 self)
 Add to MetaCart
From a softwaretechnology point of view, thekernel concept is superior to large integrated kernels. On the other hand, it is widely believed that (a)kernel based systems are inherently inefficient and (b) they are not sufficiently flexible. Contradictory to this belief, we show and support
Principal Curves
, 1989
"... Principal curves are smooth onedimensional curves that pass through the middle of a pdimensional data set, providing a nonlinear summary of the data. They are nonparametric, and their shape is suggested by the data. The algorithm for constructing principal curve starts with some prior summary, suc ..."
Abstract

Cited by 388 (1 self)
 Add to MetaCart
, such as the usual principalcomponent line. The curve in each successive iteration is a smooth or local average of the pdimensional points, where the definition of local is based on the distance in arc length of the projections of the points onto the curve found in the previous iteration. In this article principal
Understanding FaultTolerant Distributed Systems
 COMMUNICATIONS OF THE ACM
, 1993
"... We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design ..."
Abstract

Cited by 374 (23 self)
 Add to MetaCart
We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design alternatives, we discuss their relative merits and we give examples of systems which adopt one approach or the other. The aim is to introduce some order in the complex discipline of designing and understanding faulttolerant distributed systems.
2475–2479 This journal is © The Royal Society of Chemistry 2008 Pu bl ish ed o n M ar ch 8. D ow nl oa de d by P en ns yl va ni a St at e U ni ve rs ity o n /0
, 2008
"... First published as an Advance Article on the web 3rd January 2001 The electrochemical generation and characterisation of a variety of oquinodimethanes (oQDMs) are described together with the outcome of preparative experiments in which they are key intermediates. The quinodimethanes are convenientl ..."
Abstract

Cited by 339 (7 self)
 Add to MetaCart
First published as an Advance Article on the web 3rd January 2001 The electrochemical generation and characterisation of a variety of oquinodimethanes (oQDMs) are described together with the outcome of preparative experiments in which they are key intermediates. The quinodimethanes are conveniently formed, in DMF, by both direct and redoxcatalysed electroreduction of 1,2bis(halomethyl)arenes. Their predominant reaction is polymerisation to poly(oxylylene) (oPX) polymers. In the presence of dienophiles the electrogenerated oQDMs may undergo efficient cycloaddition reaction and distinctions between the possible mechanisms have been attempted on the basis of voltammetric, preparative and stereochemical experiments. Contrary to the precedent of the corresponding methyl ester, diphenyl maleate radicalanion isomerises only slowly to the fumarate radicalanion, yet coelectrolysis of 2,3bis(bromomethyl)1,4dimethoxybenzene and diphenyl maleate or diphenyl fumarate gives exclusively the corresponding transadduct. Coelectrolysis of dimethyl maleate with either 1,2bis(bromomethyl)benzene (more easily reduced) or 2,3bis(bromomethyl)1,4dimethoxybenzene (less easily reduced) gave only oPX polymer. The results are rationalised in terms of a double nucleophilic substitution mechanism where electron transfer between dienophile radicalanion and dihalide is relatively slow. Where electron transfer from maleate or fumarate radicalanions is likely to be fast oquinodimethanes are formed by redoxcatalysis and they polymerise rather than undergo Diels–Alder reaction. Dimerisation of the dienophile radicalanions, with k2 = 104 to 105 M1 s1, does not apparently compete with nucleophilic substitution or, where relevant, electron transfer.
Results 1  10
of
2,306,727