911 search results - page 47 / 183 » Kolmogorov Complexity Cores |
151
click to vote
CORR
2000
Springer
15 years 6 months ago
2000
Springer
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
158
click to vote
TKDE
2010
15 years 4 months ago
2010
—Long time-series datasets are common in many domains, especially scientific domains. Applications in these fields often require comparing trajectories using similarity measure...
129
click to vote
ISCA
2008
IEEE
16 years 16 days ago
2008
IEEE
There is still much performance to be gained by out-of-order processors with wider issue widths. However, traditional methods of increasing issue width do not scale; that is, they...
160
click to vote
ECAI
2010
Springer
15 years 4 months ago
2010
Springer
We investigate the complexity of axiom pinpointing for different members of the DL-Lite family of Description Logics. More precisely, we consider the problem of enumerating all mi...
160
click to vote
NIPS
2004
15 years 7 months ago
2004
act out the core search problem of active learning schemes, to better understand the extent to which adaptive labeling can improve sample complexity. We give various upper and low...