Results 1 - 10 of 20,449

Computing semantic relatedness using Wikipedia-based explicit semantic analysis

by Evgeniy Gabrilovich, Shaul Markovitch - In Proceedings of the 20th International Joint Conference on Artificial Intelligence , 2007
"... Computing semantic relatedness of natural language texts requires access to vast amounts of common-sense and domain-specific world knowledge. We propose Explicit Semantic Analysis (ESA), a novel method that represents the meaning of texts in a high-dimensional space of concepts derived from Wikipedi ..."
Abstract - Cited by 562 (9 self) - Add to MetaCart
Computing semantic relatedness of natural language texts requires access to vast amounts of common-sense and domain-specific world knowledge. We propose Explicit Semantic Analysis (ESA), a novel method that represents the meaning of texts in a high-dimensional space of concepts derived from

Explicitly Computing Modular Forms

by William A. Stein - GRADUATE STUDIES IN MATHEMATICS. AMERICAN MATHEMATICAL SOCIETY , 2006
"... ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract not found

Explicit Computations on the Desingularized

by Kummer Surface, V. G. Lopez Neumann, Constantin Manoil , 906
"... Abstract. We find formulas for the birational maps from a Kummer surface K and its dual K ∗ to their common minimal desingularization S. We show how the nodes of K blow up. Then we give a description of the group of linear automorphisms of S. ..."
Abstract - Add to MetaCart
Abstract. We find formulas for the birational maps from a Kummer surface K and its dual K ∗ to their common minimal desingularization S. We show how the nodes of K blow up. Then we give a description of the group of linear automorphisms of S.

Explicit computations of Siegel modular forms . . .

by Martin Raum, Nathan C. Ryan, et al.
"... ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract not found

EXPLICIT COMPUTATIONS IN THE HURWITZ QUATERNION ORDER

by Mikhail G. Katz, Mary Schaps, Uzi Vishne , 2007
"... Abstract. We clarify the explici structure of the Hurwitz quaternion order, which is of fundamental importance in Riemann surface theory. Contents 1. Congruence towers and the 4/3 bound 1 2. The Hurwitz order 2 3. A basis for the maximal order 4 ..."
Abstract - Add to MetaCart
Abstract. We clarify the explici structure of the Hurwitz quaternion order, which is of fundamental importance in Riemann surface theory. Contents 1. Congruence towers and the 4/3 bound 1 2. The Hurwitz order 2 3. A basis for the maximal order 4

EXPLICIT COMPUTATIONS WITH THE DIVIDED SYMMETRIZATION OPERATOR

by Tewodros Amdeberhan
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

MULTILISP: a language for concurrent symbolic computation

by Robert H. Halstead - ACM Transactions on Programming Languages and Systems , 1985
"... Multilisp is a version of the Lisp dialect Scheme extended with constructs for parallel execution. Like Scheme, Multilisp is oriented toward symbolic computation. Unlike some parallel programming languages, Multilisp incorporates constructs for causing side effects and for explicitly introducing par ..."
Abstract - Cited by 529 (1 self) - Add to MetaCart
Multilisp is a version of the Lisp dialect Scheme extended with constructs for parallel execution. Like Scheme, Multilisp is oriented toward symbolic computation. Unlike some parallel programming languages, Multilisp incorporates constructs for causing side effects and for explicitly introducing

Diffraction of stochastic point sets: Explicitly computable examples

by Michael Baake, Matthias Birkner, Robert V. Moody - COMMUN. MATH. PHYS , 2009
"... Stochastic point processes relevant to the theory of long-range aperiodic order are considered that display diffraction spectra of mixed type, with special emphasis on explicitly computable cases together with a unified approach of reasonable generality. The latter is based on the classical theory ..."
Abstract - Cited by 15 (10 self) - Add to MetaCart
Stochastic point processes relevant to the theory of long-range aperiodic order are considered that display diffraction spectra of mixed type, with special emphasis on explicitly computable cases together with a unified approach of reasonable generality. The latter is based on the classical

A Theory of the Learnable

by L. G. Valiant , 1984
"... Humans appear to be able to learn new concepts without needing to be programmed explicitly in any conventional sense. In this paper we regard learning as the phenomenon of knowledge acquisition in the absence of explicit programming. We give a precise methodology for studying this phenomenon from ..."
Abstract - Cited by 1985 (15 self) - Add to MetaCart
Humans appear to be able to learn new concepts without needing to be programmed explicitly in any conventional sense. In this paper we regard learning as the phenomenon of knowledge acquisition in the absence of explicit programming. We give a precise methodology for studying this phenomenon from

Explicit computation of the q,t-Littlewood–Richardson coefficients

by Michael Schlosser - CONTEMPORARY MATHEMATICS
"... ... 337 (9) (2003), 569–574], we recently presented an explicit expansion formula for Macdonald polynomials. This result was obtained from a recursion for Macdonald polynomials which in turn was derived by inverting the Pieri formula. We use these formulae here to explicitly compute the q, t-Littlew ..."
Abstract - Add to MetaCart
... 337 (9) (2003), 569–574], we recently presented an explicit expansion formula for Macdonald polynomials. This result was obtained from a recursion for Macdonald polynomials which in turn was derived by inverting the Pieri formula. We use these formulae here to explicitly compute the q, t
Results 1 - 10 of 20,449