Sciweavers

1721 search results - page 283 / 345
» Prefetching Results of Web Searches
Sort
View
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
16 years 9 days 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
PODS
2005
ACM
115views Database» more  PODS 2005»
16 years 17 hour 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...
MDM
2005
Springer
170views Communications» more  MDM 2005»
15 years 5 months ago
The role of caching and context-awareness in P2P service discovery
Mobile terminals (cellular phones, PDAs, palmtops etc.) emerge as a new class of small-scale, ad-hoc service providers that share data and functionality via mobile web services’...
Christos Doulkeridis, Vassilis Zafeiris, Michalis ...
SIGIR
2004
ACM
15 years 5 months ago
Display time as implicit feedback: understanding task effects
Recent research has had some success using the length of time a user displays a document in their web browser as implicit feedback for document preference. However, most studies h...
Diane Kelly, Nicholas J. Belkin
EVOW
2008
Springer
15 years 1 months ago
Improving Query Expansion with Stemming Terms: A New Genetic Algorithm Approach
Nowadays, searching information in the web or in any kind of document collection has become one of the most frequent activities. However, user queries can be formulated in a way th...
Lourdes Araujo, José R. Pérez-Ag&uum...