Results 1  10
of
2,889
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
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
CONSTRUCTION OF NONUNIFORM BASIS FUNCTIONS FOR SPLINE CURVESAND SURFACES Mria Kuklisov
, 2000
"... Nonuniform basis functions for construction of interpolating and approximating spline curves and surfaces are presented. The construction is based on the theory of Bsplines and enables a continuous change from interpolation to approximation of given data. It is also possible to change the tension ..."
Abstract
 Add to MetaCart
Nonuniform basis functions for construction of interpolating and approximating spline curves and surfaces are presented. The construction is based on the theory of Bsplines and enables a continuous change from interpolation to approximation of given data. It is also possible to change the tension
Robust face recognition via sparse representation
 IEEE TRANS. PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2008
"... We consider the problem of automatically recognizing human faces from frontal views with varying expression and illumination, as well as occlusion and disguise. We cast the recognition problem as one of classifying among multiple linear regression models, and argue that new theory from sparse signa ..."
Abstract

Cited by 936 (40 self)
 Add to MetaCart
. This framework can handle errors due to occlusion and corruption uniformly, by exploiting the fact that these errors are often sparse w.r.t. to the standard (pixel) basis. The theory of sparse representation helps predict how much occlusion the recognition algorithm can handle and how to choose the training
The physiology of the grid: An open grid services architecture for distributed systems integration
, 2002
"... In both ebusiness and escience, we often need to integrate services across distributed, heterogeneous, dynamic “virtual organizations ” formed from the disparate resources within a single enterprise and/or from external resource sharing and service provider relationships. This integration can be t ..."
Abstract

Cited by 1377 (33 self)
 Add to MetaCart
, this architecture defines a uniform exposed service semantics (the Grid service); defines standard mechanisms for creating, naming, and discovering transient Grid service instances; provides location transparency and multiple protocol bindings for service instances; and supports integration with underlying native
Sampling—50 years after Shannon
 Proceedings of the IEEE
, 2000
"... This paper presents an account of the current state of sampling, 50 years after Shannon’s formulation of the sampling theorem. The emphasis is on regular sampling, where the grid is uniform. This topic has benefited from a strong research revival during the past few years, thanks in part to the math ..."
Abstract

Cited by 339 (27 self)
 Add to MetaCart
This paper presents an account of the current state of sampling, 50 years after Shannon’s formulation of the sampling theorem. The emphasis is on regular sampling, where the grid is uniform. This topic has benefited from a strong research revival during the past few years, thanks in part
Pricing in Computer Networks: Reshaping the Research Agenda
 ACM Computer Communication Review
, 1996
"... As the Internet makes the transition from research testbed to commercial enterprise, the topic of pricing in computer networks has suddenly attracted great attention. Much of the discussion in the network design community and the popular press centers on the usagebased vs. fiat pricing debate. The ..."
Abstract

Cited by 236 (2 self)
 Add to MetaCart
recover costs and so are perhaps of limited relevance, (2) congestion costs are inherently inaccessible to the network and so cannot reliably form the basis for pricing, and (3) there are other, more structural, goals besides optimality, and some of these goals are incompatible with the global uniformity
A social semantics for agent communications languages
 Proceedings of the Workshop on Agent Communication Languages, International Joint Conference on Artificial Intelligence (IJCAI99
, 2000
"... Abstract. The ability to communicate is one of the salient properties of agents. Although a number of agent communication languages (ACLs) have been developed, obtaining a suitable formal semantics for ACLs remains one of the greatest challenges of multiagent systems theory. Previous semantics have ..."
Abstract

Cited by 228 (6 self)
 Add to MetaCart
largely been mentalistic in their orientation and are based solely on the beliefs and intentions of the participating agents. Such semantics are not suitable for most multiagent applications, which involve autonomous and heterogeneous agents, whose beliefs and intentions cannot be uniformly determined
Basis
"... orthonormalization procedure impacts of the basic quadratic nonuniform spline space on the scaling and wavelet functions ..."
Abstract
 Add to MetaCart
orthonormalization procedure impacts of the basic quadratic nonuniform spline space on the scaling and wavelet functions
The PyramidTechnique: Towards Breaking the Curse of Dimensionality
, 1998
"... In this paper, we propose the PyramidTechnique, a new indexing method for highdimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the maximum metric Lruax. In contrast to all other index structures, the performance of the PyramidTechnique does not dete ..."
Abstract

Cited by 208 (2 self)
 Add to MetaCart
second step, the single pyramids are cut into slices parallel to the basis of the pyramid. These slices form the data pages. Furthermore, we show that this partition provides a mapping from the given ddimensional space to a ldimensional space. Therefore, we are able to use a B+tree to manage
Driftbalanced random stimuli: a general basis for studying nonFourier motion perception
, 1987
"... To some degree, all current models of visual motionperception mechanisms depend on the power of the visual signal in various spatiotemporalfrequency bands. Here we show how to construct counterexamples: visual stimuli that are consistently perceived as obviously moving in a fixed direction yet for ..."
Abstract

Cited by 149 (8 self)
 Add to MetaCart
, driftbalanced) random stimuli is microbalanced and drift balanced if the expectation of each component is uniformly zero; (iii) the convolution of independent microbalanced and driftbalanced random stimuli is microbalanced and drift balanced; (iv) the product of independent microbalanced random stimuli
Results 1  10
of
2,889