1850 search results - page 308 / 370 » classification 2010 |
192
click to vote
CC
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
136
click to vote
ACL
2010
15 years 2 months ago
2010
Automatic error detection is desired in the post-processing to improve machine translation quality. The previous work is largely based on confidence estimation using system-based ...
130
click to vote
ACL
2010
15 years 2 months ago
2010
Automatically identifying the polarity of words is a very important task in Natural Language Processing. It has applications in text classification, text filtering, analysis of pr...
283
click to vote
ACMDIS
2010
ACM
15 years 2 months ago
2010
ACM
Infrastructure awareness systems reveal invisible aspects of infrastructures to their existing or potential users. Designing such systems is challenging as it requires making visi...
143
click to vote
ACMSE
2010
ACM
15 years 2 months ago
2010
ACM
This paper defines and discusses a new problem in the area of subspace clustering. It defines the problem of mining closed subspace clusters. This new concept allows for the culli...