Sciweavers

2887 search results - page 57 / 578
» Name Generation and Linearity
Sort
View
GIR
2006
ACM
15 years 12 months ago
Identifying and grounding descriptions of places
In this paper we test the hypothesis Given a piece of text describing an object or concept our combined disambiguation method can disambiguate whether it is a place and ground it ...
Simon E. Overell, Stefan M. Rüger
IJCNN
2008
IEEE
16 years 11 days ago
Sparse support vector machines trained in the reduced empirical feature space
— We discuss sparse support vector machines (sparse SVMs) trained in the reduced empirical feature space. Namely, we select the linearly independent training data by the Cholesky...
Kazuki Iwamura, Shigeo Abe
COMPGEOM
2000
ACM
15 years 10 months ago
Pitfalls in computing with pseudorandom determinants
It has been known for 30 years that pseudorandom number generators in the class of linear congruential generators (LCG) exhibit strong and predictable regularities. A widely used ...
Bernd Gärtner
ATAL
2004
Springer
15 years 11 months ago
Fitting and Compilation of Multiagent Models through Piecewise Linear Functions
Decision-theoretic models have become increasingly popular as a basis for solving agent and multiagent problems, due to their ability to quantify the complex uncertainty and prefe...
David V. Pynadath, Stacy Marsella
ECOOPW
1998
Springer
15 years 10 months ago
A Rational Approach to Portable High Performance: The Basic Linear Algebra Instruction Set (BLAIS) and the Fixed Algorithm Size
Abstract. We introduce a collection of high performance kernels for basic linear algebra. The kernels encapsulate small xed size computations in order to provide building blocks fo...
Jeremy G. Siek, Andrew Lumsdaine