Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,235
Efficient Additive Kernels via Explicit Feature Maps
"... Maji and Berg [13] have recently introduced an explicit feature map approximating the intersection kernel. This enables efficient learning methods for linear kernels to be applied to the non-linear intersection kernel, expanding the applicability of this model to much larger problems. In this paper ..."
Abstract
-
Cited by 245 (9 self)
- Add to MetaCart
homogeneous additive kernels along with closed form expression for all common kernels; (ii) derive corresponding approximate finitedimensional feature maps based on the Fourier sampling theorem; and (iii) quantify the extent of the approximation. We demonstrate that the approximations have indistinguishable
On Language and Connectionism: Analysis of a Parallel Distributed Processing Model of Language Acquisition
- COGNITION
, 1988
"... Does knowledge of language consist of mentally-represented rules? Rumelhart and McClelland have described a connectionist (parallel distributed processing) model of the acquisition of the past tense in English which successfully maps many stems onto their past tense forms, both regular (walk/walked) ..."
Abstract
-
Cited by 415 (13 self)
- Add to MetaCart
Does knowledge of language consist of mentally-represented rules? Rumelhart and McClelland have described a connectionist (parallel distributed processing) model of the acquisition of the past tense in English which successfully maps many stems onto their past tense forms, both regular (walk
Random features for large-scale kernel machines
- In Neural Infomration Processing Systems
, 2007
"... To accelerate the training of kernel machines, we propose to map the input data to a randomized low-dimensional feature space and then apply existing fast linear methods. Our randomized features are designed so that the inner products of the transformed data are approximately equal to those in the f ..."
Abstract
-
Cited by 258 (4 self)
- Add to MetaCart
To accelerate the training of kernel machines, we propose to map the input data to a randomized low-dimensional feature space and then apply existing fast linear methods. Our randomized features are designed so that the inner products of the transformed data are approximately equal to those
Efficient View-Dependent Image-Based Rendering with Projective Texture-Mapping
"... . This paper presents how the image-based rendering technique of viewdependent texture-mapping (VDTM) can be efficiently implemented using projective texture mapping, a feature commonly available in polygon graphics hardware. VDTM is a technique for generating novel views of a scene with approximate ..."
Abstract
-
Cited by 277 (10 self)
- Add to MetaCart
. This paper presents how the image-based rendering technique of viewdependent texture-mapping (VDTM) can be efficiently implemented using projective texture mapping, a feature commonly available in polygon graphics hardware. VDTM is a technique for generating novel views of a scene
Probabilistic robot navigation in partially observable environments
- In Proc. of the International Joint Conference on Artificial Intelligence (IJCAI
, 1995
"... Autonomous mobile robots need very reliable navigation capabilities in order to operate unattended for long periods of time. This paper reports on first results of a research program that uses partially observable Markov models to robustly track a robot’s location in office environments and to direc ..."
Abstract
-
Cited by 293 (13 self)
- Add to MetaCart
and to direct its goal-oriented actions. The approach explicitly maintains a probability distribution over the possible locations of the robot, taking into account various sources of uncertainty, including approximate knowledge of the environment, and actuator and sensor uncertainty. A novel feature of our
Being Bayesian about network structure
- Machine Learning
, 2000
"... Abstract. In many multivariate domains, we are interested in analyzing the dependency structure of the underlying distribution, e.g., whether two variables are in direct interaction. We can represent dependency structures using Bayesian network models. To analyze a given data set, Bayesian model sel ..."
Abstract
-
Cited by 299 (3 self)
- Add to MetaCart
selection attempts to find the most likely (MAP) model, and uses its structure to answer these questions. However, when the amount of available data is modest, there might be many models that have non-negligible posterior. Thus, we want compute the Bayesian posterior of a feature, i.e., the total posterior
Epipolarplane image analysis: An approach to determining structure from motion
- INTERN..1. COMPUTER VISION
, 1987
"... We present a technique for building a three-dimensional description of a static scene from a dense sequence of images. These images are taken in such rapid succession that they form a solid block of data in which the temporal continuity from image to image is approximately equal to the spatial conti ..."
Abstract
-
Cited by 253 (3 self)
- Add to MetaCart
-line camera motions, these slices have a simple linear structure that makes them easier to analyze. The analysis computes the threedimensional positions of object features, marks occlusion boundaries on the objects, and builds a threedimensional map of "free space." In our article, we first describe
Approximations and selections of multivalued mappings of finite-dimensional spaces
- JP Jour. Geometry and Topology
"... Abstract. We prove extension-dimensional versions of finite dimensional selection and approximation theorems. As applications, we obtain several results on extension dimension. ..."
Abstract
-
Cited by 7 (7 self)
- Add to MetaCart
Abstract. We prove extension-dimensional versions of finite dimensional selection and approximation theorems. As applications, we obtain several results on extension dimension.
Equilibrium Measures for Coupled Map Lattices: Existence, Uniqueness and Finite-Dimensional Approximations
, 1997
"... Abstract We consider coupled map lattices of hyperbolic type, i.e., chains of weakly interacting hyperbolic sets (attractors) over multi-dimensional lattices. We describe thermodynamic formalism of the underlying spin lattice system and then prove existence, uniqueness, mixing properties, and expone ..."
Abstract
-
Cited by 32 (3 self)
- Add to MetaCart
Abstract We consider coupled map lattices of hyperbolic type, i.e., chains of weakly interacting hyperbolic sets (attractors) over multi-dimensional lattices. We describe thermodynamic formalism of the underlying spin lattice system and then prove existence, uniqueness, mixing properties
Approximate Isometries on Finite-Dimensional Normed Spaces
"... . Every #-isometry u between real normed spaces of the same finite dimension which maps the origin to the origin may by uniformly approximated to within 2# by a linear isometry. Under a smoothness hypothesis, necessary and sufficient conditions are obtained for the same conclusion to hold for a ..."
Abstract
-
Cited by 7 (0 self)
- Add to MetaCart
. Every #-isometry u between real normed spaces of the same finite dimension which maps the origin to the origin may by uniformly approximated to within 2# by a linear isometry. Under a smoothness hypothesis, necessary and sufficient conditions are obtained for the same conclusion to hold for a
Results 1 - 10
of
1,235
