3708 search results - page 378 / 742 » Approximating Betweenness Centrality |
179
click to vote
MICAI
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
172
click to vote
WADS
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
167
click to vote
WEBI
2005
Springer
16 years 7 days ago
2005
Springer
The performance of an ontology alignment technique largely depends on the amount of information that can be leveraged for the alignment task. On the Semantic Web, end-users may ex...
189
click to vote
DSMML
2004
Springer
16 years 5 days ago
2004
Springer
Learning curves for Gaussian process (GP) regression can be strongly affected by a mismatch between the ‘student’ model and the ‘teacher’ (true data generation process), e...
167
click to vote
ICIP
2003
IEEE
16 years 2 days ago
2003
IEEE
We propose to use approximations of shape metrics, such as the Hausdorff distance, to define similarity measures between shapes. Our approximations being continuous and different...