10988 search results - page 550 / 2198 » Algorithmic Folding Complexity |
251
click to vote
JDCTA
2010
15 years 2 months ago
2010
Granular Computing (GrC), a knowledge-oriented computing which covers the theory of fuzzy information granularity, rough set theory, the theory of quotient space and interval comp...
171
click to vote
JSS
2010
15 years 2 months ago
2010
Test suite minimisation techniques seek to reduce the effort required for regression testing by selecting a subset of test suites. In previous work, the problem has been considere...
216
Voted
ICASSP
2011
IEEE
14 years 11 months ago
2011
IEEE
Due to multipath delay spread and relatively high sampling rate in OFDM systems, the channel estimation is formulated as a sparse recovery problem, where a hybrid compressed sensi...
220
Voted
CATA
2000
15 years 8 months ago
2000
We investigate a method to speed up the O(n3 ) labeling algorithm of Rosenfeld and Pfaltz for segmenting binary images, which is unduly complex for large images. That algorithm sea...
236
click to vote
ICDAR
2005
IEEE
16 years 1 months ago
2005
IEEE
This paper presents an algorithm using adaptive local connectivity map for retrieving text lines from the complex handwritten documents such as handwritten historical manuscripts....