Sciweavers

1389 search results - page 188 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
ICML
2003
IEEE
15 years 8 months ago
An Evaluation on Feature Selection for Text Clustering
Feature selection methods have been successfully applied to text categorization but seldom applied to text clustering due to the unavailability of class label information. In this...
Tao Liu, Shengping Liu, Zheng Chen, Wei-Ying Ma
SIGIR
2009
ACM
15 years 9 months ago
Extracting structured information from user queries with semi-supervised conditional random fields
When search is against structured documents, it is beneficial to extract information from user queries in a format that is consistent with the backend data structure. As one step...
Xiao Li, Ye-Yi Wang, Alex Acero
PODS
2009
ACM
100views Database» more  PODS 2009»
16 years 3 months ago
Space-optimal heavy hitters with strong error bounds
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...
Radu Berinde, Graham Cormode, Piotr Indyk, Martin ...
PODC
2004
ACM
15 years 8 months ago
Compact routing on euclidian metrics
We consider the problem of designing a compact communication network that supports efficient routing in an Euclidean plane. Our network design and routing scheme achieves 1+ stret...
Ittai Abraham, Dahlia Malkhi
EMNLP
2010
15 years 1 months ago
Confidence in Structured-Prediction Using Confidence-Weighted Models
Confidence-Weighted linear classifiers (CW) and its successors were shown to perform well on binary and multiclass NLP problems. In this paper we extend the CW approach for sequen...
Avihai Mejer, Koby Crammer