4940 search results - page 405 / 988 » On the Complexity of Universal Programs |
172
click to vote
ICIP
2005
IEEE
16 years 8 months ago
2005
IEEE
As a key part of universal source coding, context quantization is very important for improving compression performance. However, in most existing methods, the quantizer is trained...
207
click to vote
VIS
2007
IEEE
16 years 8 months ago
2007
IEEE
We describe our visualization process for a particle-based simulation of the formation of the first stars and their impact on cosmic history. The dataset consists of several hundre...
186
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
In hedonic games, players have the opportunity to form coalitions, and have preferences over the coalitions they might join. Such games can be used to model a variety of settings ...
180
click to vote
CIE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...
162
click to vote
FCCM
2005
IEEE
16 years 13 days ago
2005
IEEE
As technology sizes decrease and die area increases, designers are creating increasingly complex computing systems using FPGAs. To reduce design time for new products, the reuse o...