828 search results - page 132 / 166 » Bounded Hairpin Completion |
TSP
2008
13 years 9 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
JUCS
2007
13 years 9 months ago
2007
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
TWC
2008
2008
On the design, selection algorithm and performance analysis of limited feedback transmit beamforming
13 years 9 months ago
Multiple-input multiple-output (MIMO) systems achieve significant diversity and array gains by using transmit beamforming. When complete channel state information (CSI) is not avai...
ALGORITHMICA
2002
13 years 9 months ago
2002
We study exploration problems where a robot has to construct a complete map of an unknown environment using a path that is as short as possible. In the rst problem setting we cons...
COMBINATORICS
2004
13 years 9 months ago
2004
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive...