Sciweavers

1334 search results - page 162 / 267
» Composite kernel learning
Sort
View
HPCS
2009
IEEE
15 years 7 months ago
FFT-Based Dense Polynomial Arithmetic on Multi-cores
We report efficient implementation techniques for FFT-based dense multivariate polynomial arithmetic over finite fields, targeting multi-cores. We have extended a preliminary study...
Marc Moreno Maza, Yuzhen Xie
ICIAP
1999
ACM
15 years 8 months ago
Texture Segmentation by Frequency-Sensitive Elliptical Competitive Learning
In this paper a new learning algorithm is proposed with the purpose of texture segmentation. The algorithm is a competitive clustering scheme with two specific features: elliptic...
Steve De Backer, Paul Scheunders
AAAI
2008
15 years 6 months ago
Efficient Learning of Action Schemas and Web-Service Descriptions
This work addresses the problem of efficiently learning action schemas using a bounded number of samples (interactions with the environment). We consider schemas in two languages-...
Thomas J. Walsh, Michael L. Littman
IFM
2007
Springer
101views Formal Methods» more  IFM 2007»
15 years 10 months ago
Translating FSP into LOTOS and Networks of Automata
Many process calculi have been proposed since Robin Milner and Tony Hoare opened the way more than 25 years ago. Although they are based on the same kernel of operators, most of th...
Gwen Salaün, Jeff Kramer, Frédé...
EDBT
2009
ACM
277views Database» more  EDBT 2009»
15 years 8 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...