Sciweavers

1429 search results - page 204 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
ICCBR
2003
Springer
14 years 28 days ago
Using Evolution Programs to Learn Local Similarity Measures
Abstract. The definition of similarity measures is one of the most crucial aspects when developing case-based applications. In particular, when employing similarity measures that ...
Armin Stahl, Thomas Gabel
IJCNN
2000
IEEE
14 years 3 days ago
On MCMC Sampling in Bayesian MLP Neural Networks
Bayesian MLP neural networks are a flexible tool in complex nonlinear problems. The approach is complicated by need to evaluate integrals over high-dimensional probability distri...
Aki Vehtari, Simo Särkkä, Jouko Lampinen
GLOBECOM
2009
IEEE
13 years 11 months ago
Localization Using Radial Basis Function Networks and Signal Strength Fingerprints in WLAN
Abstract—Fingerprinting localization techniques provide reliable location estimates and enable the development of location aware applications especially for indoor environments, ...
Christos Laoudias, Paul Kemppi, Christos G. Panayi...
ECAI
2008
Springer
13 years 9 months ago
Towards Efficient Belief Update for Planning-Based Web Service Composition
At the "functional level", Semantic Web Services (SWS) are described akin to planning operators, with preconditions and effects relative to an ontology; the ontology prov...
Jörg Hoffmann
RSS
2007
134views Robotics» more  RSS 2007»
13 years 9 months ago
A Fast and Practical Algorithm for Generalized Penetration Depth Computation
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
Liangjun Zhang, Young J. Kim, Dinesh Manocha