Results 1  10
of
9,767
A tutorial on support vector machines for pattern recognition
 Data Mining and Knowledge Discovery
, 1998
"... The tutorial starts with an overview of the concepts of VC dimension and structural risk minimization. We then describe linear Support Vector Machines (SVMs) for separable and nonseparable data, working through a nontrivial example in detail. We describe a mechanical analogy, and discuss when SV ..."
Abstract

Cited by 3393 (12 self)
 Add to MetaCart
large (even infinite) VC dimension by computing the VC dimension for homogeneous polynomial and Gaussian radial basis function kernels. While very high VC dimension would normally bode ill for generalization performance, and while at present there exists no theory which shows that good generalization
KodairaSpencer theory of gravity and exact results for quantum string amplitudes
 Commun. Math. Phys
, 1994
"... We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a particu ..."
Abstract

Cited by 540 (59 self)
 Add to MetaCart
particular realization of the N = 2 theories, the resulting string field theory is equivalent to a topological theory in six dimensions, the Kodaira– Spencer theory, which may be viewed as the closed string analog of the Chern–Simon theory. Using the mirror map this leads to computation of the ‘number
Fronts propagating with curvature dependent speed: algorithms based on Hamilton–Jacobi formulations
, 1988
"... We devise new numerical algorithms, called PSC algorithms, for following fronts propagating with curvaturedependent speed. The speed may be an arbitrary function of curvature, and the front also can be passively advected by an underlying flow. These algorithms approximate the equations of motion, w ..."
Abstract

Cited by 1183 (60 self)
 Add to MetaCart
in the moving fronts. The algorithms handle topological merging and breaking naturally, work in any number of space dimensions, and do not require that the moving surface be written as a function. The methods can be also used for more general HamiltonJacobitype problems. We demonstrate our algorithms
Mirror Manifolds and Topological Field Theory
 in Essays on Mirror Manifolds (ed. S.T. Yau), International Press, Hong Kong
, 1992
"... In N = 4 super YangMills theory on a fourmanifold M, one can specify a discrete magnetic flux valued in H2 (M,ZN). This flux is encoded in the AdS/CFT correspondence in terms of a fivedimensional topological field theory with ChernSimons action. A similar topological field theory in seven dimens ..."
Abstract

Cited by 380 (12 self)
 Add to MetaCart
In N = 4 super YangMills theory on a fourmanifold M, one can specify a discrete magnetic flux valued in H2 (M,ZN). This flux is encoded in the AdS/CFT correspondence in terms of a fivedimensional topological field theory with ChernSimons action. A similar topological field theory in seven
Web Modeling Language (WebML): a modeling language for designing Web sites
, 2000
"... Designing and maintaining Web applications is one of the major challenges for the software industry of the year 2000. In this paper we present Web Modeling Language (WebML), a notation for specifying complex Web sites at the conceptual level. WebML enables the highlevel description of a Web site un ..."
Abstract

Cited by 426 (15 self)
 Add to MetaCart
under distinct orthogonal dimensions: its data content (structural model), the pages that compose it (composition model), the topology of links between pages (navigation model), the layout and graphic requirements for page rendering (presentation model), and the customization features for one
Mean Topological Dimension
 Israel J. Math
, 2000
"... . In this paper we present some results and applications of a new invariant for dynamical systems that can be viewed as a dynamical analogue of topological dimension. This invariant has been introduced by M. Gromov, and enables one to assign a meaningful quantity to dynamical systems of infinite ..."
Abstract

Cited by 67 (2 self)
 Add to MetaCart
of infinite topological dimension and entropy. We also develop an alternative approach that is metric dependent and is intimately related to topological entropy. 1. Introduction One of the basic invariants of a dynamical system (X; T ) is its topological entropy. This quantifies to what extent nearby
Surface Reconstruction by Voronoi Filtering
 Discrete and Computational Geometry
, 1998
"... We give a simple combinatorial algorithm that computes a piecewiselinear approximation of a smooth surface from a finite set of sample points. The algorithm uses Voronoi vertices to remove triangles from the Delaunay triangulation. We prove the algorithm correct by showing that for densely sampled ..."
Abstract

Cited by 405 (11 self)
 Add to MetaCart
surfaces, where density depends on "local feature size", the output is topologically valid and convergent (both pointwise and in surface normals) to the original surface. We describe an implementation of the algorithm and show example outputs. 1 Introduction The problem of reconstructing a
Mesh Optimization
, 1993
"... We present a method for solving the following problem: Given a set of data points scattered in three dimensions and an initial triangular mesh wH, produce a mesh w, of the same topological type as wH, that fits the data well and has a small number of vertices. Our approach is to minimize an energy f ..."
Abstract

Cited by 392 (8 self)
 Add to MetaCart
We present a method for solving the following problem: Given a set of data points scattered in three dimensions and an initial triangular mesh wH, produce a mesh w, of the same topological type as wH, that fits the data well and has a small number of vertices. Our approach is to minimize an energy
Superstrings and topological strings at large
 N”, J. Math. Phys
"... We embed the large N ChernSimons/topological string duality in ordinary superstrings. This corresponds to a large N duality between generalized gauge systems with N = 1 supersymmetry in 4 dimensions and superstrings propagating on noncompact CalabiYau manifolds with certain fluxes turned on. We a ..."
Abstract

Cited by 254 (27 self)
 Add to MetaCart
We embed the large N ChernSimons/topological string duality in ordinary superstrings. This corresponds to a large N duality between generalized gauge systems with N = 1 supersymmetry in 4 dimensions and superstrings propagating on noncompact CalabiYau manifolds with certain fluxes turned on. We
Oligomorphic permutation groups
 LONDON MATHEMATICAL SOCIETY STUDENT TEXTS
, 1999
"... A permutation group G (acting on a set Ω, usually infinite) is said to be oligomorphic if G has only finitely many orbits on Ω n (the set of ntuples of elements of Ω). Such groups have traditionally been linked with model theory and combinatorial enumeration; more recently their grouptheoretic pro ..."
Abstract

Cited by 320 (26 self)
 Add to MetaCart
A permutation group G (acting on a set Ω, usually infinite) is said to be oligomorphic if G has only finitely many orbits on Ω n (the set of ntuples of elements of Ω). Such groups have traditionally been linked with model theory and combinatorial enumeration; more recently their group
Results 1  10
of
9,767