4894 search results - page 614 / 979 » The Guarding Problem - Complexity and Approximation |
138
click to vote
RECOMB
2005
Springer
16 years 4 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
126
click to vote
OSDI
2008
ACM
16 years 4 months ago
2008
ACM
Production systems are commonly plagued by intermittent problems that are difficult to diagnose. This paper describes a new diagnostic tool, called Chopstix, that continuously col...
150
click to vote
EDBT
2006
ACM
16 years 4 months ago
2006
ACM
Scientific data in the life sciences is distributed over various independent multi-format databases and is constantly expanding. We discuss a scenario where a life science research...
141
click to vote
DCC
2003
IEEE
16 years 3 months ago
2003
IEEE
This paper introduces a linear programming (LP) technique that performs ratedistortion based optimization for constrained video coding. Given the assumption of piecewise linear an...
127
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We consider the problem of detecting a vector of symbols that is being transmitted over a fading multiple?input multiple?output (MIMO) channel, where each symbol is an ?th root of...