13706 search results - page 2442 / 2742 » Information Problems in Information Society |
163
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
Discovering mappings between concept hierarchies is widely regarded as one of the hardest and most urgent problems facing the Semantic Web. The problem is even harder in domains w...
189
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
Given a set of machines and a set of Web applications with dynamically changing demands, an online application placement controller decides how many instances to run for each appl...
176
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
Traditional spectral classification has been proved to be effective in dealing with both labeled and unlabeled data when these data are from the same domain. In many real world ap...
133
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
We consider the wavelet synopsis construction problem for data streams where given n numbers we wish to estimate the data by constructing a synopsis, whose size, say B is much sma...
225
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
In this paper, we define and study a novel text mining problem, which we refer to as Comparative Text Mining (CTM). Given a set of comparable text collections, the task of compara...