Sciweavers

2111 search results - page 107 / 423
» Understanding the Yarowsky Algorithm
Sort
View
CORR
2006
Springer
126views Education» more  CORR 2006»
14 years 10 months ago
Evaluating the Robustness of Learning from Implicit Feedback
This paper evaluates the robustness of learning from implicit feedback in web search. In particular, we create a model of user behavior by drawing upon user studies in laboratory ...
Filip Radlinski, Thorsten Joachims
JSAC
2006
180views more  JSAC 2006»
14 years 9 months ago
A Tutorial on Decomposition Methods for Network Utility Maximization
A systematic understanding of the decomposability structures in network utility maximization is key to both resource allocation and functionality allocation. It helps us obtain the...
Daniel Pérez Palomar, Mung Chiang
SIAMCOMP
2008
103views more  SIAMCOMP 2008»
14 years 9 months ago
Compression in Finite Fields and Torus-Based Cryptography
Abstract. We present efficient compression algorithms for subgroups of multiplicative groups of finite fields, we use our compression algorithms to construct efficient public key c...
Karl Rubin, Alice Silverberg
COLING
2010
14 years 4 months ago
Conundrums in Unsupervised Keyphrase Extraction: Making Sense of the State-of-the-Art
State-of-the-art approaches for unsupervised keyphrase extraction are typically evaluated on a single dataset with a single parameter setting. Consequently, it is unclear how effe...
Kazi Saidul Hasan, Vincent Ng
CVPR
2004
IEEE
15 years 12 months ago
Robust Color Object Detection Using Spatial-Color Joint Probability Functions
Object detection in unconstrained images is an important image understanding problem with many potential applications. There has been little success in creating a single algorithm...
David J. Crandall, Jiebo Luo