416 search results - page 45 / 84 » Simple and Efficient Algorithm for Approximate Dictionary Ma... |
COCOON
2008
Springer
13 years 9 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
CSL
2002
Springer
13 years 7 months ago
2002
Springer
We survey the use of weighted finite-state transducers (WFSTs) in speech recognition. We show that WFSTs provide a common and natural representation for HMM models, context-depend...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
In this paper we present a novel boosting algorithm for supervised learning that incorporates invariance to data transformations and has high generalization capabilities. While on...
ECCV
2004
Springer
13 years 11 months ago
2004
Springer
A novel method allowing simplified and efficient active surface initialization for 3D images segmentation is presented. Our method allows to initialize an active surface through si...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...