13306 search results - page 2246 / 2662 » Theoretical Computer Science |
178
click to vote
ITCC
2000
IEEE
15 years 12 months ago
2000
IEEE
Standard JPEG decompression reconstructs quantized DCT coefficients to the center of the quantization bin. This fails to exploit the nonuniform distribution of the AC coefficien...
200
click to vote
CIKM
2000
Springer
15 years 12 months ago
2000
Springer
RankBoost is a recently proposed algorithm for learning ranking functions. It is simple to implement and has strong justifications from computational learning theory. We describe...
189
click to vote
CAIP
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. In this article, we deal with fast algorithms for the quaternionic Fourier transform (QFT). Our aim is to give a guideline for choosing algorithms in practical cases. Hen...
192
click to vote
CP
1999
Springer
15 years 11 months ago
1999
Springer
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
185
Voted
CSL
1999
Springer
15 years 11 months ago
1999
Springer
Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...