1091 search results - page 204 / 219 » Approximation Algorithms for Data Placement Problems |
PODS
2005
ACM
14 years 8 months ago
2005
ACM
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
ACCV
2009
Springer
14 years 2 months ago
2009
Springer
Face recognition using image-set or video sequence as input tends to be more robust since image-set or video sequence provides much more information than single snapshot about the ...
ADC
2007
Springer
14 years 2 months ago
2007
Springer
Histograms are used extensively for selectivity estimation and approximate query processing. Workloadaware dynamic histograms can self-tune itself based on query feedback without ...
WWW
2010
ACM
14 years 3 months ago
2010
ACM
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
DAGM
2009
Springer
14 years 2 months ago
2009
Springer
We present a novel algorithm for the markerless tracking of deforming surfaces such as faces. We acquire a sequence of 3D scans along with color images at 40Hz. The data is then re...