494 search results - page 43 / 99 » Heap Building Bounds |
151
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
Abstract—We consider the problem of side-information scalable (SI-scalable) source coding, where the encoder constructs a two-layer description, such that the receiver with high ...
148
click to vote
INFOCOM
2009
IEEE
16 years 13 days ago
2009
IEEE
Abstract—This paper is about designing optimal highthroughput hashing schemes that minimize the total number of memory accesses needed to build and access an hash table. Recent s...
142
click to vote
COCO
2009
Springer
16 years 11 days ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
158
Voted
AIMSA
2008
Springer
16 years 4 days ago
2008
Springer
Relational instance-based learning (RIBL) algorithms offer high prediction capabilities. However, they do not scale up well, specially in domains where there is a time bound for c...
164
click to vote
IJCNN
2006
IEEE
15 years 11 months ago
2006
IEEE
We propose a new semi-supervised model selection method that is derived by applying the structural risk minimization principle to a recent semi-supervised generalization error bou...