Sciweavers

1671 search results - page 117 / 335
» Hierarchical graph maps
Sort
View
ICASSP
2011
IEEE
13 years 1 months ago
Polytope kernel density estimates on Delaunay graphs
We present a polytope-kernel density estimation (PKDE) methodology that allows us to perform exact mean-shift updates along the edges of the Delaunay graph of the data. We discuss...
Erhan Bas, Deniz Erdogmus
DAGM
2003
Springer
14 years 3 months ago
Hierarchy of Partitions with Dual Graph Contraction
Abstract. We present a hierarchical partitioning of images using a pairwise similarity function on a graph-based representation of an image. This function measures the difference ...
Yll Haxhimusa, Walter G. Kropatsch
ESANN
2006
13 years 11 months ago
Learning Visual Invariance
Invariance is a necessary feature of a visual system able to recognize real objects in all their possible appearance. It is also the processing step most problematic to understand ...
Alessio Plebe
IVEVA
2004
13 years 11 months ago
Groups and Crowds with behaviors specified in the environment
Abstract. In this paper we describe a system where behavior of characters and groups of characters are determined by assigning attributes to groups and individuals hierarchically a...
Isaac Rudomín, Fernando Perez, Erik Mill&aa...
FCCM
2006
IEEE
113views VLSI» more  FCCM 2006»
14 years 4 months ago
GraphStep: A System Architecture for Sparse-Graph Algorithms
— Many important applications are organized around long-lived, irregular sparse graphs (e.g., data and knowledge bases, CAD optimization, numerical problems, simulations). The gr...
Michael DeLorimier, Nachiket Kapre, Nikil Mehta, D...