Sciweavers

775 search results - page 128 / 155
» Map Labeling and Its Generalizations
Sort
View
IANDC
2010
151views more  IANDC 2010»
13 years 6 months ago
Complete sets of cooperations
The structure map turning a set into the carrier of a final coalgebra is not unique. This fact is well-known but commonly elided. In this paper we argue that any such concrete re...
Clemens Kupke, Jan J. M. M. Rutten
PAMI
2011
13 years 2 months ago
Approximate Nearest Subspace Search
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
NHM
2010
100views more  NHM 2010»
13 years 2 months ago
A 2-adic approach of the human respiratory tree
We propose here a general framework to address the question of trace operators on a dyadic tree. This work is motivated by the modeling of the human bronchial tree which, thanks t...
Frédéric Bernicot, Bertrand Maury, D...
ICASSP
2011
IEEE
12 years 11 months ago
Using residual vector quantization for image content classification
Multistage residual vector quantizers (RVQ) with optimal direct sum decoder codebooks have been successfully designed and implemented for data compression. Due to its multistage s...
Syed Irteza Ali Khan, Christopher F. Barnes
GECCO
2011
Springer
264views Optimization» more  GECCO 2011»
12 years 11 months ago
Critical factors in the performance of novelty search
Novelty search is a recently proposed method for evolutionary computation designed to avoid the problem of deception, in which the fitness function guides the search process away...
Steijn Kistemaker, Shimon Whiteson