3096 search results - page 225 / 620 » The Generalized FITC Approximation |
169
click to vote
WWW
2007
ACM
16 years 6 months ago
2007
ACM
The ability to extract meaningful fragments from an ontology is key for ontology re-use. We propose a definition of a module that guarantees to completely capture the meaning of a...
171
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
Hidden Markov models (HMMs) have received considerable attention in various communities (e.g, speech recognition, neurology and bioinformatic) since many applications that use HMM...
180
Voted
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requ...
160
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Maji and Berg [13] have recently introduced an explicit feature map approximating the intersection kernel. This enables efficient learning methods for linear kernels to be applied...
163
click to vote
IPPS
2009
IEEE
16 years 18 days ago
2009
IEEE
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...