• 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 11 - 20 of 9,767
Next 10 →

N=4 topological strings

by Nathan Berkovits, Cumrun Vafa - Nucl. Phys. B , 1995
"... We show how to make a topological string theory starting from an N = 4 superconformal theory. The critical dimension for this theory is ĉ = 2 (c = 6). It is shown that superstrings (in both the RNS and GS formulations) and critical N = 2 strings are special cases of this topological theory. Applicat ..."
Abstract - Cited by 225 (23 self) - Add to MetaCart
We show how to make a topological string theory starting from an N = 4 superconformal theory. The critical dimension for this theory is ĉ = 2 (c = 6). It is shown that superstrings (in both the RNS and GS formulations) and critical N = 2 strings are special cases of this topological theory

Electric-Magnetic duality and the geometric Langlands program

by Anton Kapustin, Edward Witten , 2006
"... The geometric Langlands program can be described in a natural way by compactifying on a Riemann surface C a twisted version of N = 4 super Yang-Mills theory in four dimensions. The key ingredients are electric-magnetic duality of gauge theory, mirror symmetry of sigma-models, branes, Wilson and ’t H ..."
Abstract - Cited by 294 (26 self) - Add to MetaCart
The geometric Langlands program can be described in a natural way by compactifying on a Riemann surface C a twisted version of N = 4 super Yang-Mills theory in four dimensions. The key ingredients are electric-magnetic duality of gauge theory, mirror symmetry of sigma-models, branes, Wilson and ’t

Using Canny’s criteria to derive a recursively implemented optimal edge detector

by Rachid Deriche - J. OF COMP. VISION , 1987
"... A highly efficient recursive algorithm for edge detection is presented. Using Canny's design [1], we show that a solution to his precise formulation of detection and localization for an infinite extent filter leads to an optimal operator in one dimension, which can be efficiently implemented by ..."
Abstract - Cited by 289 (14 self) - Add to MetaCart
A highly efficient recursive algorithm for edge detection is presented. Using Canny's design [1], we show that a solution to his precise formulation of detection and localization for an infinite extent filter leads to an optimal operator in one dimension, which can be efficiently implemented

Phases of N = 2 theories in two dimensions

by Edward Witten - NUCL. PHYS. B , 1993
"... By looking at phase transitions which occur as parameters are varied in supersymmetric gauge theories, a natural relation is found between sigma models based on Calabi-Yau hypersurfaces in weighted projective spaces and Landau-Ginzburg models. The construction permits one to recover the known corres ..."
Abstract - Cited by 235 (1 self) - Add to MetaCart
correspondence between these types of models and to greatly extend it to include new classes of manifolds and also to include models with (0, 2) world-sheet supersymmetry. The construction also predicts the possibility of certain physical processes involving a change in the topology of space-time.

Consistency of the group lasso and multiple kernel learning

by Francis R. Bach - JOURNAL OF MACHINE LEARNING RESEARCH , 2007
"... We consider the least-square regression problem with regularization by a block 1-norm, i.e., a sum of Euclidean norms over spaces of dimensions larger than one. This problem, referred to as the group Lasso, extends the usual regularization by the 1-norm where all spaces have dimension one, where it ..."
Abstract - Cited by 274 (33 self) - Add to MetaCart
We consider the least-square regression problem with regularization by a block 1-norm, i.e., a sum of Euclidean norms over spaces of dimensions larger than one. This problem, referred to as the group Lasso, extends the usual regularization by the 1-norm where all spaces have dimension one, where

A scheme for robust distributed sensor fusion based on average consensus

by Lin Xiao, Stephen Boyd , Sanjay Lall - PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INFORMATION PROCESSING IN SENSOR NETWORKS (IPSN , 2005
"... We consider a network of distributed sensors, where each sensor takes a linear measurement of some unknown parameters, corrupted by independent Gaussian noises. We propose a simple distributed iterative scheme, based on distributed average consensus in the network, to compute the maximum-likelihoo ..."
Abstract - Cited by 257 (3 self) - Add to MetaCart
compute a local weighted least-squares estimate, which converges to the global maximum-likelihood solution. This scheme is robust to unreliable communication links. We show that it works in a network with dynamically changing topology, provided that the infinitely occurring communication graphs

OPEN PROBLEMS IN INFINITE-DIMENSIONAL TOPOLOGY

by Taras Banakh, Robert Cauty, Michael Zarichnyi
"... Abstract. We ask some questions lying on the borderline of infinite-dimensional topology and related areas such as Dimension Theory, Descriptive Set The- ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Abstract. We ask some questions lying on the borderline of infinite-dimensional topology and related areas such as Dimension Theory, Descriptive Set The-

TOPOLOGICAL GAMES AND COVERING DIMENSION

by Liljana Babinkostova
"... Abstract. We consider a natural way of extending the Lebesgue covering dimension to various classes of infinite dimensional separable metric spaces. All spaces in this paper are assumed to be separable metric spaces. Infinite games can be used in a natural way to define ordinal valued functions on t ..."
Abstract - Add to MetaCart
Abstract. We consider a natural way of extending the Lebesgue covering dimension to various classes of infinite dimensional separable metric spaces. All spaces in this paper are assumed to be separable metric spaces. Infinite games can be used in a natural way to define ordinal valued functions

TOPOLOGICAL GAMES AND COVERING DIMENSION

by unknown authors , 909
"... Abstract. We consider a natural way of extending the Lebesgue covering dimension to various classes of infinite dimensional separable metric spaces. All spaces in this paper are assumed to be separable metric spaces. Infinite games can be used in a natural way to define ordinal valued functions on t ..."
Abstract - Add to MetaCart
Abstract. We consider a natural way of extending the Lebesgue covering dimension to various classes of infinite dimensional separable metric spaces. All spaces in this paper are assumed to be separable metric spaces. Infinite games can be used in a natural way to define ordinal valued functions

Topological Gauge Theories and Group Cohomology

by Robbert Dijkgraaf, Edward Witten , 1989
"... We show that three dimensional Chern-Simons gauge theories with a compact gauge group G (not necessarily connected or simply connected) can be classified by the integer cohomology group H 4 (BG, Z). In a similar way, possible Wess-Zumino in-teractions of such a group G are classified by H 3 (G, Z). ..."
Abstract - Cited by 170 (2 self) - Add to MetaCart
might be called Z2 graded chiral algebras (or chiral superalgebras) in two dimensions. Finally we discuss in some detail the for-mulation of these topological gauge theories for the special case of a finite group, establishing links with two dimensional (holomorphic) orbifold models.
Next 10 →
Results 11 - 20 of 9,767
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