2520 search results - page 212 / 504 » The complexity of approximating entropy |
142
click to vote
CIKM
2009
Springer
16 years 15 days ago
2009
Springer
Histogram construction or sequence segmentation is a basic task with applications in database systems, information retrieval, and knowledge management. Its aim is to approximate a...
156
click to vote
ISAAC
2009
Springer
16 years 14 days ago
2009
Springer
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
161
click to vote
GLOBECOM
2007
IEEE
16 years 7 days ago
2007
IEEE
—Comprehensive performance analysis of the unordered V-BLAST algorithm with various power allocation strategies is presented, which makes use of analytical tools and resorts to M...
136
click to vote
COCO
2005
Springer
15 years 11 months ago
2005
Springer
We study the complexity of approximating Max NME3SAT, a variant of Max 3SAT when the instances are guaranteed to not have any mixed clauses, i.e., every clause has either all its ...
139
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...