Sciweavers

8220 search results - page 1259 / 1644
» Querying XML Data
Sort
View
WSDM
2012
ACM
285views Data Mining» more  WSDM 2012»
14 years 3 months ago
Probabilistic models for personalizing web search
We present a new approach for personalizing Web search results to a specific user. Ranking functions for Web search engines are typically trained by machine learning algorithms u...
David Sontag, Kevyn Collins-Thompson, Paul N. Benn...
SIGIR
2012
ACM
13 years 10 months ago
To index or not to index: time-space trade-offs in search engines with positional ranking functions
Positional ranking functions, widely used in web search engines, improve result quality by exploiting the positions of the query terms within documents. However, it is well known ...
Diego Arroyuelo, Senén González, Mau...
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
13 years 10 months ago
The cell probe complexity of dynamic range counting
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
Kasper Green Larsen
ICDE
2008
IEEE
130views Database» more  ICDE 2008»
16 years 9 months ago
A Sampling-Based Approach to Information Recovery
There has been a recent resurgence of interest in research on noisy and incomplete data. Many applications require information to be recovered from such data. For example, in sens...
Junyi Xie, Jun Yang 0001, Yuguo Chen, Haixun Wang,...
204
Voted
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
16 years 8 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
« Prev « First page 1259 / 1644 Last » Next »