Sciweavers

1573 search results - page 183 / 315
» A Data Structure for Sponsored Search
Sort
View
DELOS
2001
15 years 8 months ago
Client Side Personalization
We describe an approach to personalization that emphasizes the "client side." We posit the need for a highly individualistic user context that resides on the client mach...
Lillian N. Cassel, Ursula Wolz
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
15 years 7 months ago
The number of bit comparisons used by Quicksort: an average-case analysis
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...
James Allen Fill, Svante Janson
CIKM
2010
Springer
15 years 4 months ago
Probabilistic ranking for relational databases based on correlations
This paper proposes a ranking method to exploit statistical correlations among pairs of attribute values in relational databases. For a given query, the correlations of the query ...
Jaehui Park, Sang-goo Lee
KDD
2008
ACM
186views Data Mining» more  KDD 2008»
16 years 7 months ago
Scalable and near real-time burst detection from eCommerce queries
In large scale online systems like Search, eCommerce, or social network applications, user queries represent an important dimension of activities that can be used to study the imp...
Nish Parikh, Neel Sundaresan
ICLP
2001
Springer
15 years 11 months ago
On a Tabling Engine That Can Exploit Or-Parallelism
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing solutions to goals. Quite a few interesting applications of tabling...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...