Sciweavers

149 search results - page 23 / 30
» BIRCH: An Efficient Data Clustering Method for Very Large Da...
Sort
View
VLDB
2002
ACM
137views Database» more  VLDB 2002»
13 years 7 months ago
Comparing Data Streams Using Hamming Norms (How to Zero In)
Massive data streams are now fundamental to many data processing applications. For example, Internet routers produce large scale diagnostic data streams. Such streams are rarely s...
Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthu...
WWW
2009
ACM
14 years 8 months ago
A search-based method for forecasting ad impression in contextual advertising
Contextual advertising (also called content match) refers to the placement of small textual ads within the content of a generic web page. It has become a significant source of rev...
Xuerui Wang, Andrei Z. Broder, Marcus Fontoura, Va...
VLDB
1998
ACM
91views Database» more  VLDB 1998»
13 years 11 months ago
Determining Text Databases to Search in the Internet
Text data in the Internet can be partitioned into many databases naturally. Efficient retrieval of desired data can be achieved if we can accurately predict the usefulness of each...
Weiyi Meng, King-Lup Liu, Clement T. Yu, Xiaodong ...
SIGMOD
2007
ACM
159views Database» more  SIGMOD 2007»
14 years 7 months ago
Boosting topic-based publish-subscribe systems with dynamic clustering
We consider in this paper a class of Publish-Subscribe (pub-sub) systems called topic-based systems, where users subscribe to topics and are notified on events that belong to thos...
Tova Milo, Tal Zur, Elad Verbin
KDD
2012
ACM
271views Data Mining» more  KDD 2012»
11 years 10 months ago
GigaTensor: scaling tensor analysis up by 100 times - algorithms and discoveries
Many data are modeled as tensors, or multi dimensional arrays. Examples include the predicates (subject, verb, object) in knowledge bases, hyperlinks and anchor texts in the Web g...
U. Kang, Evangelos E. Papalexakis, Abhay Harpale, ...