Results 1  10
of
12,790
Programming in several dimensions
 In Proc. SoftVis ’99, (Ed A Quigley
, 1999
"... Writing a program to solve a problem is a process that can be divided into two phases: first, we invent a mental model of the solution; secondly, we map the mental model onto a physical representation. The mental model is multidimensional and syntaxfree; in today’s textual programming languages, th ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Writing a program to solve a problem is a process that can be divided into two phases: first, we invent a mental model of the solution; secondly, we map the mental model onto a physical representation. The mental model is multidimensional and syntaxfree; in today’s textual programming languages, the physical representation is singledimensional and syntaxburdened. In fact, it hasn’t changed greatly since Algol 60. Mapping from one representation to the other has remained a painstaking and errorprone task, in spite of the ready availability of immensely faster computers, massive amounts of memory, highresolution graphics displays, and powerful graphic input mechanisms. The Hyperprogramming paradigm exploits these capabilities. A hyperprogramming language employs different visualisations for different program components for example one visual syntax is suitable for visualising algorithms and another is suitable for visualising subroutine nesting. Each visualisation is designed for minimal overlap with the others, and where overlap is essential, hyperlinks between the views are automatically provided to allow easy navigation between them, and automatic updating of shared information. HyperPascal was developed as a vehicle for exploring this idea. In creating a program, a HyperPascal programmer edits information in three main visualisations: • the action window visualisation, which represents algorithms using a visual language based on structure diagrams; • the data structure templates visual component, which represents dynamic data structure algorithms using beforeandafter pictures • the scope window visualisation, which represents declarations as a nested visualisation analogous to conventional subroutine nesting
The MarkovKrein correspondence in several dimensions
, 1998
"... We compute the joint moments of several linear functionals with respect to a Dirichlet random measure and some of its generalizations. Given a probability distribution on a space X, let M = M denote the random probability measure on X known as Dirichlet random measure with the parameter distributi ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We compute the joint moments of several linear functionals with respect to a Dirichlet random measure and some of its generalizations. Given a probability distribution on a space X, let M = M denote the random probability measure on X known as Dirichlet random measure with the parameter
Topology of Kleinian Groups in Several Dimensions
"... this paper I organize higherdimensional Kleinian groups according to the topology of their limit sets, trying to contrast and compare them with the Kleinian subgroups of PSL(2; C ). In this setting, one of the key questions that I was trying to address is the interaction between the geometry and to ..."
Abstract
 Add to MetaCart
theorem and its failure in higher dimensions (section 6). Next I consider the representation varieties of Kleinian groups and topological and geometrical constrains on Kleinian groups in higher dimensions. Lastly, I discuss generalizations of Kleinian groups: uniformly quasiconformal groups, fundamental
The MarkovKrein correspondence in several dimensions
, 2004
"... Given a probability distribution τ on a space X, letM = Mτ denote the random probability measure on X known as Dirichlet random measure with parameter distribution τ. We prove the formula ..."
Abstract
 Add to MetaCart
Given a probability distribution τ on a space X, letM = Mτ denote the random probability measure on X known as Dirichlet random measure with parameter distribution τ. We prove the formula
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
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
Homological Algebra of Mirror Symmetry
 in Proceedings of the International Congress of Mathematicians
, 1994
"... Mirror Symmetry was discovered several years ago in string theory as a duality between families of 3dimensional CalabiYau manifolds (more precisely, complex algebraic manifolds possessing holomorphic volume elements without zeroes). The name comes from the symmetry among Hodge numbers. For dual Ca ..."
Abstract

Cited by 523 (3 self)
 Add to MetaCart
Mirror Symmetry was discovered several years ago in string theory as a duality between families of 3dimensional CalabiYau manifolds (more precisely, complex algebraic manifolds possessing holomorphic volume elements without zeroes). The name comes from the symmetry among Hodge numbers. For dual
A solution to Plato’s problem: The latent semantic analysis theory of acquisition, induction, and representation of knowledge
 PSYCHOLOGICAL REVIEW
, 1997
"... How do people know as much as they do with as little information as they get? The problem takes many forms; learning vocabulary from text is an especially dramatic and convenient case for research. A new general theory of acquired similarity and knowledge representation, latent semantic analysis (LS ..."
Abstract

Cited by 1816 (10 self)
 Add to MetaCart
(LSA), is presented and used to successfully simulate such learning and several other psycholinguistic phenomena. By inducing global knowledge indirectly from local cooccurrence data in a large body of representative text, LSA acquired knowledge about the full vocabulary of English at a comparable
The geometry of graphs and some of its algorithmic applications
 COMBINATORICA
, 1995
"... In this paper we explore some implications of viewing graphs as geometric objects. This approach offers a new perspective on a number of graphtheoretic and algorithmic problems. There are several ways to model graphs geometrically and our main concern here is with geometric representations that res ..."
Abstract

Cited by 524 (19 self)
 Add to MetaCart
In this paper we explore some implications of viewing graphs as geometric objects. This approach offers a new perspective on a number of graphtheoretic and algorithmic problems. There are several ways to model graphs geometrically and our main concern here is with geometric representations
Guaranteed minimumrank solutions of linear matrix equations via nuclear norm minimization,”
 SIAM Review,
, 2010
"... Abstract The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system identification and control, Euclidean embedding, and col ..."
Abstract

Cited by 562 (20 self)
 Add to MetaCart
for the linear transformation defining the constraints, the minimum rank solution can be recovered by solving a convex optimization problem, namely the minimization of the nuclear norm over the given affine space. We present several random ensembles of equations where the restricted isometry property holds
Myrinet: A GigabitperSecond Local Area Network
 IEEE Micro
, 1995
"... Abstract. Myrinet is a new type of localarea network (LAN) based on the technology used for packet communication and switching within "massivelyparallel processors " (MPPs). Think of Myrinet as an MPP messagepassing network that can span campus dimensions, rather than as a widea ..."
Abstract

Cited by 1011 (0 self)
 Add to MetaCart
Abstract. Myrinet is a new type of localarea network (LAN) based on the technology used for packet communication and switching within "massivelyparallel processors " (MPPs). Think of Myrinet as an MPP messagepassing network that can span campus dimensions, rather than as a wide
Results 1  10
of
12,790