Results 1  10
of
480,562
LogP: Towards a Realistic Model of Parallel Computation
, 1993
"... A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly specific models that have few representatives in the real world. Both kinds of models encourage exploitation of formal loopholes, rather than rewarding developme ..."
Abstract

Cited by 560 (15 self)
 Add to MetaCart
parallel algorithms and to offer guidelines to machine designers. Such a model must strike a balance between detail and simplicity in order to reveal important bottlenecks without making analysis of interesting problems intractable. The model is based on four parameters that specify abstractly
Guaranteed minimumrank solutions of linear matrix equations via nuclear norm minimization,”
 SIAM Review,
, 2010
"... Abstract The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system identification and control, Euclidean embedding, and col ..."
Abstract

Cited by 562 (20 self)
 Add to MetaCart
Abstract The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system identification and control, Euclidean embedding
Stacked generalization
 NEURAL NETWORKS
, 1992
"... This paper introduces stacked generalization, a scheme for minimizing the generalization error rate of one or more generalizers. Stacked generalization works by deducing the biases of the generalizer(s) with respect to a provided learning set. This deduction proceeds by generalizing in a second sp ..."
Abstract

Cited by 731 (9 self)
 Add to MetaCart
for the NETtalk task of translating text to phonemes. The second demonstrates how stacked generalization improves the performance of a single surfacefitter. With the other experimental evidence in the literature, the usual arguments supporting crossvalidation, and the abstract justifications presented
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
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 Shannon
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
 Journal of the ACM
, 1998
"... Abstract. We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions. For every fixed c Ͼ 1 and given any n nodes in 2 , a randomized version of the scheme finds a (1 ϩ 1/c)approximation to the optimum traveling salesman tour in O(n(log n) O(c) ) time. When the nodes ..."
Abstract

Cited by 397 (2 self)
 Add to MetaCart
to Christofides) achieves a 3/2approximation in polynomial time. We also give similar approximation schemes for some other NPhard Euclidean problems: Minimum Steiner Tree, kTSP, and kMST. (The running times of the algorithm for kTSP and kMST involve an additional multiplicative factor k.) The previous best
A finitevolume, incompressible Navier–Stokes model for studies of the ocean on parallel computers.
 J. Geophys. Res.,
, 1997
"... Abstract. The numerical implementation of an ocean model based on the incompressible Navier Stokes equations which is designed for studies of the ocean circulation on horizontal scales less than the depth of the ocean right up to global scale is described. A "pressure correction" method i ..."
Abstract

Cited by 293 (32 self)
 Add to MetaCart
. The method makes possible a novel treatment of the boundary in which cells abutting the bottom or coast may take on irregular shapes and be "shaved" to fit the boundary. The algorithm can conveniently exploit massively parallel computers and suggests a domain decomposition which allocates vertical
The Argument
"... In the controversy in 1989 over the reported achievement of cold nuclear fusion, parts of the physics and chemistry communities were opposed in both a theoretic and a professional competition. Physicists saw the chemists ' announcement as an incursion into territory allocated to their own disci ..."
Abstract
 Add to MetaCart
In the controversy in 1989 over the reported achievement of cold nuclear fusion, parts of the physics and chemistry communities were opposed in both a theoretic and a professional competition. Physicists saw the chemists ' announcement as an incursion into territory allocated to their own discipline and strove to restore the interdisciplinary boundaries that had previously held. The events that followed throw light on the manner in which scientists ' knowledge claims and metascientific beliefs are affected by their membership of disciplinary communities. In particular, the controversy offers evidence for a constructivist reinterpretation of the "division of nature into levels, " which is customarily held to underpin the division of science into disciplines. 1. Cognitive Sociology and Disciplinary Phenomena Phenomena arising from the division of science into separate disciplines have been extensively studied by historians and sociologists of science, in several waves. Among the earliest studies were those contributing to "interest theory, " or the sociological explanation of scientists'general behavior by appeal to their professional interests. These studies focused heavily on competition among practitioners within single disciplines. Such competition is fueled by the practitioners ' knowledge that reward is made available in only limited amount by the professional organizations that govern the discipline. It frequently centers on priority of discovery, or of announcement of discovery, because such priority has come to constitute an important determinant of the distribution of rewards within science.1 While competition within individual disciplines received close attention from studies
Generating Hard Instances of Lattice Problems (Extended Abstract)
 In Proceedings of the TwentyEighth Annual ACM Symposium on the Theory of Computing
, 1996
"... . We give a random class of lattices in Z n so that, if there is a probabilistic polynomial time algorithm which finds a short vector in a random lattice with a probability of at least 1 2 then there is also a probabilistic polynomial time algorithm which solves the following three lattice probl ..."
Abstract

Cited by 143 (0 self)
 Add to MetaCart
problems in every lattice in Z n with a probability exponentially close to one. (1) Find the length of a shortest nonzero vector in an ndimensional lattice, approximately, up to a polynomial factor. (2) Find the shortest nonzero vector in an ndimensional lattice L where the shortest vector v is unique
Results 1  10
of
480,562