Sciweavers

648 search results - page 64 / 130
» A general dimension for query learning
Sort
View
SIGIR
2008
ACM
13 years 8 months ago
Learning to rank at query-time using association rules
Some applications have to present their results in the form of ranked lists. This is the case of many information retrieval applications, in which documents must be sorted accordi...
Adriano Veloso, Humberto Mossri de Almeida, Marcos...
WSDM
2012
ACM
267views Data Mining» more  WSDM 2012»
12 years 4 months ago
Learning to rank with multi-aspect relevance for vertical search
Many vertical search tasks such as local search focus on specific domains. The meaning of relevance in these verticals is domain-specific and usually consists of multiple well-d...
Changsung Kang, Xuanhui Wang, Yi Chang, Belle L. T...
EDBT
2010
ACM
135views Database» more  EDBT 2010»
14 years 3 months ago
Region-based online promotion analysis
This paper addresses a fundamental and challenging problem with broad applications: efficient processing of region-based promotion queries, i.e., to discover the top-k most inter...
Tianyi Wu, Yizhou Sun, Cuiping Li, Jiawei Han
ALT
2004
Springer
14 years 5 months ago
Complexity of Pattern Classes and Lipschitz Property
Rademacher and Gaussian complexities are successfully used in learning theory for measuring the capacity of the class of functions to be learned. One of the most important propert...
Amiran Ambroladze, John Shawe-Taylor
CRYPTO
2000
Springer
124views Cryptology» more  CRYPTO 2000»
14 years 1 months ago
Fast Correlation Attacks through Reconstruction of Linear Polynomials
The task of a fast correlation attack is to efficiently restore the initial content of a linear feedback shift register in a stream cipher using a detected correlation with the out...
Thomas Johansson, Fredrik Jönsson