Sciweavers

672 search results - page 76 / 135
» Words and forbidden factors
Sort
View
CIKM
2009
Springer
14 years 3 months ago
Analyzing and evaluating query reformulation strategies in web search logs
Users frequently modify a previous search query in hope of retrieving better results. These modifications are called query reformulations or query refinements. Existing research h...
Jeff Huang, Efthimis N. Efthimiadis
ACL
1997
13 years 10 months ago
Contrastive Accent in a Data-to-Speech System
Being able to predict the placement of contrastive accent is essential for the assignment of correct accentuation patterns in spoken language generation. I discuss two approaches ...
Mariët Theune
SIGIR
2008
ACM
13 years 8 months ago
Enhancing text clustering by leveraging Wikipedia semantics
Most traditional text clustering methods are based on "bag of words" (BOW) representation based on frequency statistics in a set of documents. BOW, however, ignores the ...
Jian Hu, Lujun Fang, Yang Cao, Hua-Jun Zeng, Hua L...
SIAMCOMP
2008
124views more  SIAMCOMP 2008»
13 years 8 months ago
A Faster, Better Approximation Algorithm for the Minimum Latency Problem
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
Aaron Archer, Asaf Levin, David P. Williamson
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
13 years 8 months ago
Universal Limit Laws for Depths in Random Trees
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
Luc Devroye