2638 search results - page 123 / 528 » Random Geometric Complexes |
146
click to vote
ICANN
2010
Springer
15 years 4 months ago
2010
Springer
We propose a data structure that decreases complexity of unsupervised competitive learning algorithms which are based on the growing cells structures approach. The idea is based on...
157
click to vote
CC
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
121
click to vote
IJCV
2000
15 years 4 months ago
2000
We present a universal statistical model for texture images in the context of an overcomplete complex wavelet transform. The model is parameterized by a set of statistics computed ...
128
click to vote
CGF
2008
15 years 4 months ago
2008
In this paper we introduce the constrained tetrahedralization as a new acceleration structure for ray tracing. A constrained tetrahedralization of a scene is a tetrahedralization ...
151
click to vote
CVPR
2005
IEEE
16 years 6 months ago
2005
IEEE
Hand-drawn diagrams present a complex recognition problem. Elements of the diagram are often individually ambiguous, and require context to be interpreted. We present a recognitio...