3946 search results - page 352 / 790 » The computational complexity of choice sets |
156
Voted
ICMCS
2006
IEEE
16 years 27 days ago
2006
IEEE
— A progressive and scalable, region of interest (ROI) image coding scheme based on matching pursuits (MP) is presented. Matching pursuit is a multi-resolutional signal analysis ...
172
click to vote
VTC
2006
IEEE
16 years 26 days ago
2006
IEEE
Abstract— This paper proposes a suboptimal maximum likelihood detection (MLD) algorithm for multiple-input multipleoutput (MIMO) communications. The proposed algorithm regards tr...
187
click to vote
COLT
2005
Springer
16 years 12 days ago
2005
Springer
We start by showing that in an active learning setting, the Perceptron algorithm needs Ω( 1 ε2 ) labels to learn linear separators within generalization error ε. We then prese...
197
Voted
RSCTC
2004
Springer
16 years 6 days ago
2004
Springer
Abstract. In this paper, we discuss approximation spaces in a granular computing framework. Such approximation spaces generalise the approaches to concept approximation existing in...
200
Voted
CAISE
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. The foundation of a process model lies in its control flow specifications. Using a generic process modeling language for workflows, we show how a control flow specificati...