Results 1  10
of
1,305
Querying Heterogeneous Information Sources Using Source Descriptions
, 1996
"... We witness a rapid increase in the number of structured information sources that are available online, especially on the WWW. These sources include commercial databases on product information, stock market information, real estate, automobiles, and entertainment. We would like to use the data stored ..."
Abstract

Cited by 724 (34 self)
 Add to MetaCart
featured database systems and can answer only a small set of queries over their data (for example, forms on the WWW restrict the set of queries one can ask). (3) Since the number of sources is very large, effective techniques are needed to prune the set of information sources accessed to answer a query. (4
Intrinsic statistics on Riemannian manifolds: Basic tools for geometric measurements
, 1999
"... Measurements of geometric primitives, such as rotations or rigid transformations, are often noisy and we need to use statistics either to reduce the uncertainty or to compare measurements. Unfortunately, geometric primitives often belong to manifolds and not vector spaces. We have already shown [9] ..."
Abstract

Cited by 202 (24 self)
 Add to MetaCart
Measurements of geometric primitives, such as rotations or rigid transformations, are often noisy and we need to use statistics either to reduce the uncertainty or to compare measurements. Unfortunately, geometric primitives often belong to manifolds and not vector spaces. We have already shown [9
Quantization of Fourform Fluxes and Dynamical Neutralization Of The Cosmological Constant
, 2000
"... A fourform gauge flux makes a variable contribution to the cosmological constant. This has often been assumed to take continuous values, but we argue that it has a generalized Dirac quantization condition. For a single flux the steps are much larger than the observational limit, but we show that wi ..."
Abstract

Cited by 274 (21 self)
 Add to MetaCart
that with multiple fluxes the allowed values can form a sufficiently dense ‘discretuum’. Multiple fluxes generally arise in M theory compactifications on manifolds with nontrivial threecycles. In theories with large extra dimensions a few fourforms suffice; otherwise of order 100 are needed. Starting from generic
Automated Manifold Surgery: Constructing Geometrically Accurate and Topologically Correct Models of the Human Cerebral Cortex
, 2001
"... Highly accurate surface models of the cerebral cortex are becoming increasingly important as tools in the investigation of the functional organization of the human brain. The construction of such models is difficult using current neuroimaging technology due to the high degree of cortical folding. E ..."
Abstract

Cited by 167 (25 self)
 Add to MetaCart
, flattening, or spherical morphing of the reconstructed cortex. Surface deformation techniques can guarantee the topological correctness of a model, but are timeconsuming and may result in geometrically inaccurate models. In order to address this need we have developed a technique for taking a model
On the fundamental groups of trees of manifolds
 PACIFIC J. MATH
, 2005
"... We consider limits of inverse sequences of closed manifolds, whose consecutive terms are obtained by connect summing with closed manifolds, which are in turn trivialized by the bonding maps. Such spaces, which we refer to as trees of manifolds, need not be semilocally simply connected at any point ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
We consider limits of inverse sequences of closed manifolds, whose consecutive terms are obtained by connect summing with closed manifolds, which are in turn trivialized by the bonding maps. Such spaces, which we refer to as trees of manifolds, need not be semilocally simply connected at any point
Harmonic functions for quadrilateral remeshing of arbitrary manifolds
 COMPUTERAIDED GEOMETRIC DESIGN
, 2005
"... In this paper, we propose a new quadrilateral remeshing method for manifolds of arbitrary genus that is at once general, flexible, and efficient. Our technique is based on the use of smooth harmonic scalar fields defined over the mesh. Given such a field, we compute its gradient field and a second v ..."
Abstract

Cited by 73 (2 self)
 Add to MetaCart
that adapt to the local shape. Our scalar field construction allows users to exercise extensive control over the structure of the final mesh. The entire process is performed without computing an explicit parameterization of the surface, and is thus applicable to manifolds of any genus without the need
Discretizing manifolds via minimum energy points
 NOTICES OF THE AMS
, 2004
"... There are a variety of needs for the discretization of a manifold—statistical sampling, quadrature rules, starting points for Newton’s method, computeraided design, interpolation schemes, finite element tessellations—to name but a few. So let us assume we are given a ddimensional manifold A in the ..."
Abstract

Cited by 67 (13 self)
 Add to MetaCart
There are a variety of needs for the discretization of a manifold—statistical sampling, quadrature rules, starting points for Newton’s method, computeraided design, interpolation schemes, finite element tessellations—to name but a few. So let us assume we are given a ddimensional manifold A
Action Classification on Product Manifolds
"... Videos can be naturally represented as multidimensional arrays known as tensors. However, the geometry of the tensor space is often ignored. In this paper, we argue that the underlying geometry of the tensor space is an important property for action classification. We characterize a tensor as a poin ..."
Abstract

Cited by 31 (5 self)
 Add to MetaCart
point on a product manifold and perform classification on this space. First, we factorize a tensor relating to each order using a modified High Order Singular Value Decomposition (HOSVD). We recognize each factorized space as a Grassmann manifold. Consequently, a tensor is mapped to a point on a product
NonIterative, FeaturePreserving Mesh Smoothing
 ACM Transactions on Graphics
, 2003
"... With the increasing use of geometry scanners to create 3D models, there is a rising need for fast and robust mesh smoothing to remove inevitable noise in the measurements. While most previous work has favored diffusionbased iterative techniques for featurepreserving smoothing, we propose a radicall ..."
Abstract

Cited by 151 (4 self)
 Add to MetaCart
With the increasing use of geometry scanners to create 3D models, there is a rising need for fast and robust mesh smoothing to remove inevitable noise in the measurements. While most previous work has favored diffusionbased iterative techniques for featurepreserving smoothing, we propose a
Feature Sensitive Surface Extraction from Volume Data
"... The representation of geometric objects based on volumetric data structures has advantages in many geometry processing applications that require, e.g., fast surface interrogation or boolean operations such as intersection and union. However, surface based algorithms like shape optimization (fairing) ..."
Abstract

Cited by 153 (10 self)
 Add to MetaCart
) or freeform modeling often need a topological manifold representation where neighborhood information within the surface is explicitly available. Consequently, it is necessary to find effective conversion algorithms to generate explicit surface descriptions for the geometry which is implicitly defined by a
Results 1  10
of
1,305