Sciweavers

5771 search results - page 867 / 1155
» Learning similarity space
Sort
View
ICDE
2009
IEEE
114views Database» more  ICDE 2009»
16 years 9 months ago
On Efficient Query Processing of Stream Counts on the Cell Processor
In recent years, the sketch-based technique has been presented as an effective method for counting stream items on processors with limited storage and processing capabilities, such...
Dina Thomas, Rajesh Bordawekar, Charu C. Aggarwal,...
221
Voted
WWW
2007
ACM
16 years 8 months ago
Analysis of topological characteristics of huge online social networking services
Social networking services are a fast-growing business in the Internet. However, it is unknown if online relationships and their growth patterns are the same as in real-life socia...
Yong-Yeol Ahn, Seungyeop Han, Haewoon Kwak, Sue B....
SIGMOD
2008
ACM
158views Database» more  SIGMOD 2008»
16 years 7 months ago
Sampling cube: a framework for statistical olap over sampling data
Sampling is a popular method of data collection when it is impossible or too costly to reach the entire population. For example, television show ratings in the United States are g...
Xiaolei Li, Jiawei Han, Zhijun Yin, Jae-Gil Lee, Y...
EDBT
2009
ACM
175views Database» more  EDBT 2009»
16 years 2 months ago
Towards materialized view selection for distributed databases
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
Leonardo Weiss Ferreira Chaves, Erik Buchmann, Fab...
191
Voted
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
16 years 2 months ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti