Sciweavers

2124 search results - page 25 / 425
» Aggregating time partitions
Sort
View
EOR
2010
84views more  EOR 2010»
13 years 7 months ago
Worst-case analysis of demand point aggregation for the Euclidean p-median problem
Solving large-scale p-median problems is usually time consuming. People often aggregate the demand points in a large-scale p-median problem to reduce its problem size and make it ...
Lian Qi, Zuo-Jun Max Shen
CVPR
2004
IEEE
14 years 9 months ago
Integrating Multiple Model Views for Object Recognition
We present a new approach to appearance-based object recognition, which captures the relationships between multiple model views and exploits them to improve recognition performanc...
Vittorio Ferrari, Tinne Tuytelaars, Luc J. Van Goo...
EDBT
2009
ACM
131views Database» more  EDBT 2009»
13 years 10 months ago
Sample synopses for approximate answering of group-by queries
With the amount of data in current data warehouse databases growing steadily, random sampling is continuously gaining in importance. In particular, interactive analyses of large d...
Philipp Rösch, Wolfgang Lehner
BIOINFORMATICS
2011
12 years 11 months ago
libfbi: a C++ implementation for fast box intersection and application to sparse mass spectrometry data
Abstract. This document is a preprint of the following publication: Bioinformatics (2011) 27(8): 1166-1167. Algorithms for sparse data require fast search and subset selection capa...
Marc Kirchner, Buote Xu, Hanno Steen, Judith A. J....
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
13 years 12 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer