1567 search results - page 276 / 314 » Compressing Relations and Indexes |
125
click to vote
STACS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
111
click to vote
ECCV
2010
Springer
15 years 8 months ago
2010
Springer
This paper presents algorithms for efficiently computing the covariance matrix for features that form sub-windows in a large multidimensional image. For example, several image proc...
135
click to vote
SIGMOD
1997
ACM
15 years 7 months ago
1997
ACM
Computing multiple related group-bys and aggregates is one of the core operations of On-Line Analytical Processing (OLAP) applications. Recently, Gray et al. [GBLP95] proposed the...
133
click to vote
ICMLA
2007
15 years 4 months ago
2007
— This paper addresses the problem of understanding preservation and reconstruction requirements for computeraided medical decision-making. With an increasing number of computer-...
134
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
We survey the emerging area of compression-based, parameter-free, similarity distance measures useful in data-mining, pattern recognition, learning and automatic semantics extracti...