Sciweavers

679 search results - page 126 / 136
» Approximate Temporal Aggregation
Sort
View
ICCV
2011
IEEE
12 years 8 months ago
N-best maximal decoders for part models
We describe a method for generating N-best configurations from part-based models, ensuring that they do not overlap according to some user-provided definition of overlap. We ext...
Dennis Park, Deva Ramanan
ICDE
2006
IEEE
148views Database» more  ICDE 2006»
14 years 9 months ago
Unifying the Processing of XML Streams and Relational Data Streams
Relational data streams and XML streams have previously provided two separate research foci, but their unified support by a single Data Stream Management System (DSMS) is very des...
Xin Zhou, Hetal Thakkar, Carlo Zaniolo
WWW
2007
ACM
14 years 9 months ago
The largest scholarly semantic network...ever
Scholarly entities, such as articles, journals, authors and institutions, are now mostly ranked according to expert opinion and citation data. The Andrew W. Mellon Foundation fund...
Johan Bollen, Marko A. Rodriguez, Herbert Van de S...
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
14 years 8 months ago
Statistical analysis of sketch estimators
Sketching techniques can provide approximate answers to aggregate queries either for data-streaming or distributed computation. Small space summaries that have linearity propertie...
Florin Rusu, Alin Dobra
PODS
2005
ACM
151views Database» more  PODS 2005»
14 years 8 months ago
Estimating arbitrary subset sums with few probes
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...
Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel ...