2030 search results - page 63 / 406 » Extremal Problems of Information Combining |
PAKDD
2010
ACM
14 years 1 months ago
2010
ACM
Abstract. Privacy protection in publishing transaction data is an important problem. A key feature of transaction data is the extreme sparsity, which renders any single technique i...
SAC
2011
ACM
13 years 1 days ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
NETWORKING
2011
13 years 2 days ago
2011
Abstract. Sensing mechanisms that estimate the occupancy of wireless spectrum are crucial to the success of approaches based on Dynamic Spectrum Access. In this paper, we present k...
ACL
2009
13 years 7 months ago
2009
We report in this paper our work on accurately generating case markers and suffixes in English-to-Hindi SMT. Hindi is a relatively free word-order language, and makes use of a com...
IWSAS
2001
Springer
14 years 1 months ago
2001
Springer
: This paper describes a new approach for the creation of an adaptive system able to selectively combine dynamic multidimensional information sources to perform state estimation. T...