6358 search results - page 97 / 1272 » Computing spectral sequences |
130
Voted
AAECC
1998
Springer
15 years 3 months ago
1998
Springer
The set of all linear recurrence relations satisfied by given sequences of finite length is described by the annihilator ideal of the sequences. The MasseyDing algorithm to compu...
118
click to vote
ECCV
1992
Springer
16 years 5 months ago
1992
Springer
This paper presents a computational model that segments images based on the textural properties of object surfaces. The proposed Coupled-Membrane model applies the weak membrane ap...
133
click to vote
COCO
2003
Springer
15 years 9 months ago
2003
Springer
We review and slightly strengthen known results on the Kolmogorov complexity of prefixes of effectively random sequences. First, there are recursively random random sequences su...
126
Voted
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
This paper examines the problem of extracting lowdimensional manifold structure given millions of highdimensional face images. Specifically, we address the computational challenge...
124
Voted
DCC
2008
IEEE
16 years 3 months ago
2008
IEEE
We discuss the use of lattice vector quantizers in conjunction with a quadtree-based sorting algorithm for the compression of multidimensional data sets, as encountered, for examp...