1619 search results - page 112 / 324 » Structure in the Space of Value Functions |
182
click to vote
COLT
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. The regularization functional induced by the graph Laplacian of a random neighborhood graph based on the data is adaptive in two ways. First it adapts to an underlying ma...
181
click to vote
CPM
2010
Springer
15 years 11 months ago
2010
Springer
The field of compressed data structures seeks to achieve fast search time, but using a compressed representation, ideally requiring less space than that occupied by the original i...
184
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
The top-k retrieval problem requires finding k objects most similar to a given query object. Similarities between objects are most often computed as aggregated similarities of the...
178
click to vote
KDD
2004
ACM
16 years 6 months ago
2004
ACM
Data cube pre-computation is an important concept for supporting OLAP(Online Analytical Processing) and has been studied extensively. It is often not feasible to compute a complet...
152
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
A type-based approach to termination uses sized types: an ordinal bound for the size of a data structure is stored in its type. A recursive function over a sized type is accepted i...