3244 search results - page 232 / 649 » On convex complexity measures |
162
click to vote
DOLAP
1999
ACM
15 years 11 months ago
1999
ACM
This paper describes the Phoenix system, which loads a data warehouse and then reports against it. Between the raw atomic data of the source system and the business measures prese...
181
click to vote
IMA
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. In this paper we introduce three soft-decision decoding algorithms for Reed-Solomon (RS) codes. We compare them in terms of performance over both the AWGN and Rayleigh Fa...
168
click to vote
STACS
2000
Springer
15 years 10 months ago
2000
Springer
We show that there is a set that is almost complete but not complete under polynomial-time many-one (p-m) reductions for the class E of sets computable in deterministic time 2lin ...
254
click to vote
AMR
2008
Springer
15 years 8 months ago
2008
Springer
Retrieving music from large digital databases is a demanding computational task. The cost for indexing and searching depends not only on the computational effort of measuring music...
200
click to vote
CCCG
2008
15 years 8 months ago
2008
Curve matching is an important computational task for domains such as: reconstruction of archaeological fragments, forensics investigation, measuring melodic similarity, and model...