Results 1 - 10 of 46,671

Implicit Fairing of Irregular Meshes using Diffusion and Curvature Flow

by Mathieu Desbrun , Mark Meyer, Peter Schröder, Alan H. Barr , 1999
"... In this paper, we develop methods to rapidly remove rough features from irregularly triangulated data intended to portray a smooth surface. The main task is to remove undesirable noise and uneven edges while retaining desirable geometric features. The problem arises mainly when creating high-fidelit ..."
Abstract - Cited by 542 (23 self) - Add to MetaCart
curvature flow operator that achieves a smoothing of the shape itself, distinct from any parameterization. Additional features of the algorithm include automatic exact volume preservation, and hard and soft constraints on the positions of the points in the mesh. We compare our method to previous operators

Fairness and Retaliation: The Economics of Reciprocity

by Ernst Fehr, Simon Gächter - JOURNAL OF ECONOMIC PERSPECTIVES , 2000
"... This paper shows that reciprocity has powerful implications for many economic domains. It is an important determinant in the enforcement of contracts and social norms and enhances the possibilities of collective action greatly. Reciprocity may render the provision of explicit incentive inefficient b ..."
Abstract - Cited by 583 (13 self) - Add to MetaCart
because the incentives may crowd out voluntary co-operation. It strongly limits the effects of competition in markets with incomplete contracts and gives rise to noncompetitive wage differences. Finally, reciprocity it is also a strong force contributing to the existence of incomplete contracts.

The Skyline Operator

by Stephan Börzsönyi, Donald Kossmann, Konrad Stocker - IN ICDE , 2001
"... We propose to extend database systems by a Skyline operation. This operation filters out a set of interesting points from a potentially large set of data points. A point is interesting if it is not dominated by any other point. For example, a hotel might be interesting for somebody traveling to Nass ..."
Abstract - Cited by 567 (3 self) - Add to MetaCart
We propose to extend database systems by a Skyline operation. This operation filters out a set of interesting points from a potentially large set of data points. A point is interesting if it is not dominated by any other point. For example, a hotel might be interesting for somebody traveling

The Amoeba Distributed Operating System

by Andrew S. Tanenbaum, Gregory J. Sharp, De Boelelaan A , 1992
"... INTRODUCTION Roughly speaking, we can divide the history of modern computing into the following eras: d 1970s: Timesharing (1 computer with many users) d 1980s: Personal computing (1 computer per user) d 1990s: Parallel computing (many computers per user) Until about 1980, computers were huge, e ..."
Abstract - Cited by 1069 (5 self) - Add to MetaCart
, expensive, and located in computer centers. Most organizations had a single large machine. In the 1980s, prices came down to the point where each user could have his or her own personal computer or workstation. These machines were often networked together, so that users could do remote logins on other

OPTICS: Ordering Points To Identify the Clustering Structure

by Mihael Ankerst, Markus M. Breunig, Hans-peter Kriegel, Jörg Sander , 1999
"... Cluster analysis is a primary method for database mining. It is either used as a stand-alone tool to get insight into the distribution of a data set, e.g. to focus further analysis and data processing, or as a preprocessing step for other algorithms operating on the detected clusters. Almost all of ..."
Abstract - Cited by 527 (51 self) - Add to MetaCart
Cluster analysis is a primary method for database mining. It is either used as a stand-alone tool to get insight into the distribution of a data set, e.g. to focus further analysis and data processing, or as a preprocessing step for other algorithms operating on the detected clusters. Almost all

The R*-tree: an efficient and robust access method for points and rectangles

by Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger - INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA , 1990
"... The R-tree, one of the most popular access methods for rectangles, is based on the heuristic optimization of the area of the enclosing rectangle in each inner node. By running numerous experiments in a standardized testbed under highly varying data, queries and operations, we were able to design the ..."
Abstract - Cited by 1262 (74 self) - Add to MetaCart
and quadratic R-tree and Greene's variant of the R-tree. This superiority of the R*-tree holds for different types of queries and operations, such as map overlay, for both rectangles and multidimensional points in all experiments. From a practical point of view the R*-tree is very attractive because

Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals

by Jim Gray, Adam Bosworth, Andrew Layman, Don Reichart, Hamid Pirahesh , 1996
"... Abstract. Data analysis applications typically aggregate data across many dimensions looking for anomalies or unusual patterns. The SQL aggregate functions and the GROUP BY operator produce zero-dimensional or one-dimensional aggregates. Applications need the N-dimensional generalization of these op ..."
Abstract - Cited by 860 (11 self) - Add to MetaCart
in more complex non-procedural data analysis programs. The cube operator treats each of the N aggregation attributes as a dimension of N-space. The aggregate of a particular set of attribute values is a point in this space. The set of points forms an N-dimensional cube. Super-aggregates are computed

Multidimensional Access Methods

by Volker Gaede, Oliver Günther , 1998
"... Search operations in databases require special support at the physical level. This is true for conventional databases as well as spatial databases, where typical search operations include the point query (find all objects that contain a given search point) and the region query (find all objects that ..."
Abstract - Cited by 686 (3 self) - Add to MetaCart
Search operations in databases require special support at the physical level. This is true for conventional databases as well as spatial databases, where typical search operations include the point query (find all objects that contain a given search point) and the region query (find all objects

Feeling and thinking: Preferences need no inferences

by R. B. Zajonc - AMERICAN PSYCHOLOGIST , 1980
"... Affect is considered by most contemporary theories to be postcognitive, that is, to occur only after considerable cognitive operations have been accomplished. Yet a number of experimental results on preferences, attitudes, impression formation, and decision making, as well as some clinical phenomen ..."
Abstract - Cited by 596 (2 self) - Add to MetaCart
phenomena, suggest that affective judgments may be fairly independent of, and precede in time, the sorts of perceptual and cognitive operations commonly assumed to be the basis of these affective judgments. Affective reactions to stimuli are often the very first reactions of the organism, and for lower

A computational approach to edge detection

by John Canny - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 1986
"... This paper describes a computational approach to edge detection. The success of the approach depends on the definition of a comprehensive set of goals for the computation of edge points. These goals must be precise enough to delimit the desired behavior of the detector while making minimal assumpti ..."
Abstract - Cited by 4675 (0 self) - Add to MetaCart
with different signal-to-noise ratios in the image. We present a general method, called feature synthesis, for the fine-to-coarse integration of information from operators at different scales. Finally we show that step edge detector performance improves considerably as the operator point spread function
Results 1 - 10 of 46,671