Results 1  10
of
970
Reliable Communication in the Presence of Failures
 ACM Transactions on Computer Systems
, 1987
"... The design and correctness of a communication facility for a distributed computer system are reported on. The facility provides support for faulttolerant process groups in the form of a family of reliable multicast protocols that can be used in both local and widearea networks. These protocols at ..."
Abstract

Cited by 546 (18 self)
 Add to MetaCart
properties like member rankings. A review of several uses for the protocols in the ISIS system, which supports faulttolerant resilient objects and bulletin boards, illustrates the significant simplification of higher level algorithms made possible by our approach.
Reconstruction and Representation of 3D Objects with Radial Basis Functions
 Computer Graphics (SIGGRAPH ’01 Conf. Proc.), pages 67–76. ACM SIGGRAPH
, 2001
"... We use polyharmonic Radial Basis Functions (RBFs) to reconstruct smooth, manifold surfaces from pointcloud data and to repair incomplete meshes. An object's surface is defined implicitly as the zero set of an RBF fitted to the given surface data. Fast methods for fitting and evaluating RBFs al ..."
Abstract

Cited by 505 (1 self)
 Add to MetaCart
allow us to model large data sets, consisting of millions of surface points, by a single RBFpreviously an impossible task. A greedy algorithm in the fitting process reduces the number of RBF centers required to represent a surface and results in significant compression and further computational
Appearancepreserving simplification
 IN PROC. SIGGRAPH’98
, 1998
"... We present a new algorithm for appearancepreserving simplification. Not only does it generate a lowpolygoncount approximation of a model, but it also preserves the appearance. This is accomplished for a particular display resolution in the sense that we properly sample the surface position, curva ..."
Abstract

Cited by 153 (9 self)
 Add to MetaCart
achieving significant amounts of simplification with little or no loss in rendering quality.
Iterative Optimization and Simplification of Hierarchical Clusterings
 Journal of AI Research
, 1996
"... Abstract Clustering is often used to discover structure in data. Clustering systems differ in the objective function used to evaluate clustering quality and the control strategy used to search the space of clusterings. In general, a search strategy cannot both (1) consistently construct clusterings ..."
Abstract

Cited by 120 (3 self)
 Add to MetaCart
. This paper evaluates hierarchical redistribution, which appears to be a novel optimization strategy in the clustering literature. A final component of search prunes treestructured clusterings, thus simplifying them for analysis. In particular, resampling is used to significantly simplify hierarchical
Experimental evaluation of wireless simulation assumptions
, 2004
"... All analytical and simulation research on ad hoc wireless networks must necessarily model radio propagation using simplifying assumptions. A growing body of research, however, indicates that the behavior of the protocol stack may depend significantly on these underlying assumptions. The standard res ..."
Abstract

Cited by 260 (12 self)
 Add to MetaCart
All analytical and simulation research on ad hoc wireless networks must necessarily model radio propagation using simplifying assumptions. A growing body of research, however, indicates that the behavior of the protocol stack may depend significantly on these underlying assumptions. The standard
Approaches for Bayesian variable selection
 Statistica Sinica
, 1997
"... Abstract: This paper describes and compares various hierarchical mixture prior formulations of variable selection uncertainty in normal linear regression models. These include the nonconjugate SSVS formulation of George and McCulloch (1993), as well as conjugate formulations which allow for analytic ..."
Abstract

Cited by 234 (5 self)
 Add to MetaCart
for analytical simplification. Hyperparameter settings which base selection on practical significance, and the implications of using mixtures with point priors are discussed. Computational methods for posterior evaluation and exploration are considered. Rapid updating methods are seen to provide feasible methods
Aggregating local descriptors into a compact image representation
"... We address the problem of image search on a very large scale, where three constraints have to be considered jointly: the accuracy of the search, its efficiency, and the memory usage of the representation. We first propose a simple yet efficient way of aggregating local image descriptors into a vecto ..."
Abstract

Cited by 226 (19 self)
 Add to MetaCart
vector of limited dimension, which can be viewed as a simplification of the Fisher kernel representation. We then show how to jointly optimize the dimension reduction and the indexing algorithm, so that it best preserves the quality of vector comparison. The evaluation shows that our approach
Simplification of Objects Rendered by Polygonal Approximations
 Computers & Graphics
, 1991
"... Current technology provides a means to obtain sampled data that digitally describes threedimensional surfaces and objects. Threedimensional digitizing cameras can be used to obtain sampled data that maps the surface of three dimensional figures and models. Data obtained from such sources enable ac ..."
Abstract

Cited by 47 (0 self)
 Add to MetaCart
accurate renderings of the original surface. However, the digitizing process often provides much more data than is needed to accurately recreate the surface or object. In order to use such data in realtime visual simulators, a significant reduction in the data needed to accurately render the sampled
Parallel repetition: Simplifications and the nosignaling case
 In STOC’07
, 2007
"... Consider a game where a referee chooses (x,y) according to a publicly known distribution PXY, sends x to Alice, and y to Bob. Without communicating with each other, Alice responds with a value a and Bob responds with a value b. Alice and Bob jointly win if a publicly known predicate Q(x,y, a, b) hol ..."
Abstract

Cited by 72 (0 self)
 Add to MetaCart
s is the maximal number of possible responses from Alice and Bob in the initial game, and ¯v < 1 is a constant depending only on v. In this work, we simplify Raz’s proof in various ways and thus shorten it significantly. Further we study the case where Alice and Bob are not restricted to local computations
Lazy Narrowing with Simplification
, 1997
"... Languages that integrate functional and logic programming styles with a complete operational semantics are based on narrowing. In order to avoid useless computations, lazy narrowing strategies have been proposed in the past. This paper presents an improvement of lazy narrowing by incorporating dete ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
deterministic simplification steps into lazy narrowing derivations. These simplification steps reduce the search space so that in some cases infinite search spaces are reduced to finite ones. We consider two classes of programs where this strategy can be applied. Firstly, we show soundness and completeness
Results 1  10
of
970