Sciweavers

11016 search results - page 2038 / 2204
» Digital Information Retrieval
Sort
View
144
Voted
LATIN
2010
Springer
15 years 10 months ago
Sharp Separation and Applications to Exact and Parameterized Algorithms
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grando...
140
Voted
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
15 years 10 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...
142
Voted
EDBT
2009
ACM
208views Database» more  EDBT 2009»
15 years 10 months ago
Flexible and efficient querying and ranking on hyperlinked data sources
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...
Ramakrishna Varadarajan, Vagelis Hristidis, Louiqa...
113
Voted
IRI
2009
IEEE
15 years 10 months ago
Using 4KB Page Size for Virtual Memory is Obsolete
A 4KB page size has been used for Virtual Memory since the sixties. In fact, today, the most common page size is still 4KB. Choosing a page size is finding the middle ground betwe...
Pinchas Weisberg, Yair Wiseman
122
Voted
AIRS
2009
Springer
15 years 10 months ago
A Latent Dirichlet Framework for Relevance Modeling
Relevance-based language models operate by estimating the probabilities of observing words in documents relevant (or pseudo relevant) to a topic. However, these models assume that ...
Viet Ha-Thuc, Padmini Srinivasan
« Prev « First page 2038 / 2204 Last » Next »