564 search results - page 69 / 113 » Linear Time Algorithms for Exact Distance Transform |
SISAP
2009
IEEE
14 years 4 months ago
2009
IEEE
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
DAM
2010
13 years 10 months ago
2010
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
FROCOS
2007
Springer
14 years 4 months ago
2007
Springer
Often when formalising dynamic systems, constraints such as exactly “n” of a set of values hold. In this paper, we consider reasoning about propositional linear time temporal ...
ICCV
2007
IEEE
15 years 3 days 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...
IWMM
2011
Springer
13 years 1 months ago
2011
Springer
The goal of cache management is to maximize data reuse. Collaborative caching provides an interface for software to communicate access information to hardware. In theory, it can o...