• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 4,950
Next 10 →

Comprehensible Rendering of 3-D Shapes

by Takafumi Saito, Tokiichiro Takahashi , 1990
"... We propose a new rendering technique that produces 3-D images with enhanced visual comprehensibility. Shape fea-tures can be readily understood if certain geometric proper-ties are enhanced. To achieve this, we develop drawing algo-rithms for discontinuities, edges, contour lines, and curved hatchin ..."
Abstract - Cited by 293 (0 self) - Add to MetaCart
We propose a new rendering technique that produces 3-D images with enhanced visual comprehensibility. Shape fea-tures can be readily understood if certain geometric proper-ties are enhanced. To achieve this, we develop drawing algo-rithms for discontinuities, edges, contour lines, and curved

Features of similarity.

by Amos Tversky - Psychological Review , 1977
"... Similarity plays a fundamental role in theories of knowledge and behavior. It serves as an organizing principle by which individuals classify objects, form concepts, and make generalizations. Indeed, the concept of similarity is ubiquitous in psychological theory. It underlies the accounts of stimu ..."
Abstract - Cited by 1455 (2 self) - Add to MetaCart
, errors of substitution, and correlation between occurrences. Analyses of these data attempt to explain the observed similarity relations and to capture the underlying structure of the objects under study. The theoretical analysis of similarity relations has been dominated by geometric models

Submodular functions, matroids and certain polyhedra

by Jack Edmonds , 2003
"... The viewpoint of the subject of matroids, and related areas of lattice theory, has always been, in one way or another, abstraction of algebraic dependence or, equivalently, abstraction of the incidence relations in geometric representations of algebra. Often one of the main derived facts is that all ..."
Abstract - Cited by 355 (0 self) - Add to MetaCart
The viewpoint of the subject of matroids, and related areas of lattice theory, has always been, in one way or another, abstraction of algebraic dependence or, equivalently, abstraction of the incidence relations in geometric representations of algebra. Often one of the main derived facts

Gradient flows and geometric active contour models

by Satyanad Kichenassamy, Peter Olver, Arun Kumar, Allen Tannenbaum, Anthony Yezzi - in Proc. of the 5th International Conference on Computer Vision , 1995
"... In this paper, we analyze the geometric active contour models discussed in [6, 181 from a curve evolution point of view and propose some modifications based on gradient flows relative to certain new featurebased Riemannian metrics. This leads to a novel snake paradigm in which the feature of interes ..."
Abstract - Cited by 239 (19 self) - Add to MetaCart
In this paper, we analyze the geometric active contour models discussed in [6, 181 from a curve evolution point of view and propose some modifications based on gradient flows relative to certain new featurebased Riemannian metrics. This leads to a novel snake paradigm in which the feature

On Beamforming with Finite Rate Feedback in Multiple Antenna Systems

by Krishna Kiran Mukkavilli, Ashutosh Sabharwal, Elza Erkip, Behnaam Aazhang , 2003
"... In this paper, we study a multiple antenna system where the transmitter is equipped with quantized information about instantaneous channel realizations. Assuming that the transmitter uses the quantized information for beamforming, we derive a universal lower bound on the outage probability for any f ..."
Abstract - Cited by 272 (14 self) - Add to MetaCart
is the number of feedback bits and t is the number of transmit antennas. The geometrical bounding technique, used in the proof of the lower bound, also leads to a design criterion for good beamformers, whose outage performance approaches the lower bound. The design criterion minimizes the maximum inner product

Graph embedding and extension: A general framework for dimensionality reduction

by Shuicheng Yan, Dong Xu, Benyu Zhang, Hong-jiang Zhang, Qiang Yang, Stephen Lin - IEEE TRANS. PATTERN ANAL. MACH. INTELL , 2007
"... Over the past few decades, a large family of algorithms—supervised or unsupervised; stemming from statistics or geometry theory—has been designed to provide different solutions to the problem of dimensionality reduction. Despite the different motivations of these algorithms, we present in this paper ..."
Abstract - Cited by 271 (29 self) - Add to MetaCart
in this paper a general formulation known as graph embedding to unify them within a common framework. In graph embedding, each algorithm can be considered as the direct graph embedding or its linear/kernel/tensor extension of a specific intrinsic graph that describes certain desired statistical or geometric

Evaluation of electronic and geometric proper ties of

by O. Seifarth
"... nanoparticles using XPEEM ..."
Abstract - Add to MetaCart
nanoparticles using XPEEM

Representations of Rigid Solids: Theory, Methods, and Systems

by Aristides A. G. Requicha - ACM Computing Surveys , 1980
"... Computer-based ystems for modehng the geometry ofrigid solid objects are becoming increasingly important inmechanical nd civil engineering, architecture, computer graphics, computer vision, and other fields that deal with spatial phenomena. At the heart of such systems are symbol structures (represe ..."
Abstract - Cited by 256 (2 self) - Add to MetaCart
representation of solids. The paper is divided into three parts. The first introduces a simple mathematical framework for characterizing certain important aspects of representations, for example, their semantic (geometric) ntegrity. The second part uses the framework to describe and compare all of the major

Ricci curvature for metric-measure spaces via optimal transport

by John Lott, Cédric Villani - ANN. OF MATH , 2005
"... We define a notion of a measured length space X having nonnegative N-Ricci curvature, for N ∈ [1, ∞), or having ∞-Ricci curvature bounded below by K, for K ∈ R. The definitions are in terms of the displacement convexity of certain functions on the associated Wasserstein metric space P2(X) of proba ..."
Abstract - Cited by 231 (10 self) - Add to MetaCart
) of probability measures. We show that these properties are preserved under measured Gromov-Hausdorff limits. We give geometric and analytic consequences.

A large N duality via a geometric transition

by F. Cachazo, K. Intriligator, C. Vafa - Nucl. Phys. B , 2001
"... We propose a large N dual of 4d, N = 1 supersymmetric, SU(N) Yang-Mills with adjoint field Φ and arbitrary superpotential W(Φ). The field theory is geometrically engineered via D-branes partially wrapped over certain cycles of a non-trivial Calabi-Yau geometry. The large N, or low-energy, dual arise ..."
Abstract - Cited by 187 (27 self) - Add to MetaCart
We propose a large N dual of 4d, N = 1 supersymmetric, SU(N) Yang-Mills with adjoint field Φ and arbitrary superpotential W(Φ). The field theory is geometrically engineered via D-branes partially wrapped over certain cycles of a non-trivial Calabi-Yau geometry. The large N, or low-energy, dual
Next 10 →
Results 1 - 10 of 4,950
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University