Sciweavers

3397 search results - page 570 / 680
» Block-based web search
Sort
View
180
Voted
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
16 years 6 months ago
Mining complex models from arbitrarily large databases in constant time
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
Geoff Hulten, Pedro Domingos
SIGMOD
2005
ACM
133views Database» more  SIGMOD 2005»
16 years 6 months ago
Constrained Optimalities in Query Personalization
Personalization is a powerful mechanism that helps users to cope with the abundance of information on the Web. Database query personalization achieves this by dynamically construc...
Georgia Koutrika, Yannis E. Ioannidis
PODS
2005
ACM
115views Database» more  PODS 2005»
16 years 6 months ago
A divide-and-merge methodology for clustering
We present a divide-and-merge methodology for clustering a set of objects that combines a top-down "divide" phase with a bottom-up "merge" phase. In contrast, ...
David Cheng, Santosh Vempala, Ravi Kannan, Grant W...
IUI
2009
ACM
16 years 2 months ago
Context-based page unit recommendation for web-based sensemaking tasks
Sensemaking tasks require users to perform complex research behaviors to gather and comprehend information from many sources. Such tasks are common and include, for example, resea...
Wen-Huang Cheng, David Gotz
WMCSA
2009
IEEE
16 years 21 days ago
LiveCompare: grocery bargain hunting through participatory sensing
Many consumers are misled into paying high prices due to the search costs associated with attaining price information [16]. The popularity of bargain-hunting web sites like Slickd...
Linda Deng, Landon P. Cox