Sciweavers

796 search results - page 4 / 160
» Approximating the centroid is hard
Sort
View
SODA
2012
ACM
226views Algorithms» more  SODA 2012»
11 years 10 months ago
On the hardness of pricing loss-leaders
Consider the problem of pricing n items under an unlimited supply with m buyers. Each buyer is interested in a bundle of at most k of the items. These buyers are single minded, wh...
Preyas Popat, Yi Wu
TREC
2003
13 years 8 months ago
Active Feedback - UIUC TREC-2003 HARD Experiments
In this paper, we report our experiments on the HARD (High Accuracy Retrieval from Documents) Track in TREC 2003. We focus on active feedback, i.e., how to intelligently propose q...
Xuehua Shen, ChengXiang Zhai

Publication
197views
12 years 3 months ago
Convex non-negative matrix factorization for massive datasets
Non-negative matrix factorization (NMF) has become a standard tool in data mining, information retrieval, and signal processing. It is used to factorize a non-negative data matrix ...
C. Thurau, K. Kersting, M. Wahabzada, and C. Bauck...
ICDAR
2011
IEEE
12 years 7 months ago
A Novel Italic Detection and Rectification Method for Chinese Advertising Images
—The italic detection and slant rectification is a key step of optical character recognition (OCR). In this paper, a novel method is proposed to detect and rectify italic charact...
Jie Liu, Heping Li, Shuwu Zhang, Wei Liang
SODA
2012
ACM
225views Algorithms» more  SODA 2012»
11 years 10 months ago
Approximating rooted Steiner networks
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
Joseph Cheriyan, Bundit Laekhanukit, Guyslain Nave...