Sciweavers

887 search results - page 149 / 178
» A Time for Choosing
Sort
View
ICDT
2009
ACM
147views Database» more  ICDT 2009»
14 years 10 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff
WWW
2009
ACM
14 years 10 months ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...
WWW
2004
ACM
14 years 10 months ago
Incremental formalization of document annotations through ontology-based paraphrasing
For the manual semantic markup of documents to become widespread, users must be able to express annotations that conform to ontologies (or schemas) that have shared meaning. Howev...
Jim Blythe, Yolanda Gil
CHI
2009
ACM
14 years 10 months ago
Dancing with myself: the interactive visual canon platform
The canon is a composition pattern with a long history and many forms. The concept of the canon has also been applied to experimental film making and on Japanese television. We de...
Christoph Bartneck, Martijn ten Bhömer, Mathi...
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 10 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han