845 search results - page 51 / 169 » Complexity Dimensions and Learnability |
84
Voted
TCS
2002
15 years 10 days ago
2002
The chords' problem is a variant of an old problem of computational geometry: given a set of points of n , one can easily build the multiset of the distances between the poi...
99
Voted
RSA
2010
14 years 11 months ago
2010
Polygon spaces like Mℓ = {(u1, · · · , un) ∈ S1 × · · · S1 ; n i=1 liui = 0}/SO(2) or they three dimensional analogues Nℓ play an important rle in geometry and topolo...
101
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
In this paper we describe a procedure to reduce the size of the input feature vector. A complex pattern recognition problem like face recognition involves huge dimension of input ...
DGCI
2006
Springer
15 years 4 months ago
2006
Springer
Critical kernels constitute a general framework settled in the of abstract complexes for the study of parallel thinning in any dimension. We take advantage of the properties of thi...
122
Voted
SYRCODIS
2007
15 years 1 months ago
2007
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...