Sciweavers

1871 search results - page 255 / 375
» Selecting for evolvable representations
Sort
View
ICIAP
2007
ACM
14 years 8 months ago
An information theoretic rule for sample size adaptation in particle filtering
To become robust, a tracking algorithm must be able to support uncertainty and ambiguity often inherently present in the data in form of occlusion and clutter. This comes usually ...
Oswald Lanz
PERCOM
2008
ACM
14 years 7 months ago
Kinds of Contexts and their Impact on Semantic Similarity Measurement
Semantic similarity measurement gained attention over the last years as a non-standard inference service for various kinds of knowledge representations including description logics...
Krzysztof Janowicz
ICASSP
2009
IEEE
14 years 2 months ago
Quadtree structured restoration algorithms for piecewise polynomial images
Iterative shrinkage of sparse and redundant representations are at the heart of many state of the art denoising and deconvolution algorithms. They assume the signal is well approx...
Adam Scholefield, Pier Luigi Dragotti
DAGM
2009
Springer
14 years 2 months ago
Pedestrian Detection by Probabilistic Component Assembly
We present a novel pedestrian detection system based on probabilistic component assembly. A part-based model is proposed which uses three parts consisting of head-shoulder, torso a...
Martin Rapus, Stefan Munder, Gregory Baratoff, Joa...
QUACON
2009
Springer
14 years 2 months ago
Establishing Similarity across Multi-granular Topological-Relation Ontologies
Within the Geospatial Semantic Web, selecting a different ontology for a spatial data set will enable that data’s analysis in a different context. Analyses of multiple data sets,...
Matthew P. Dube, Max J. Egenhofer