828 search results - page 50 / 166 » Bounded Hairpin Completion |
111
Voted
JCT
2007
15 years 14 days ago
2007
We give a new upper bound for the rectilinear crossing number cr(n) of the complete geometric graph Kn. We prove that cr(n) ≤ 0.380559 ¡n 4 ¢ + Θ(n3 ) by means of a new const...
80
Voted
JSYML
2002
15 years 7 days ago
2002
We develop the theory of germs of generic functions in simple theories. Starting with an algebraic quadrangle (or other similar hypotheses), we obtain an "almost" generic...
101
Voted
DATE
2005
IEEE
15 years 6 months ago
2005
IEEE
As the scale of electronic devices shrinks, “electronic textiles” (e-textiles) will make possible a wide variety of novel applications which are currently unfeasible. Due to t...
82
Voted
SPDP
1991
IEEE
15 years 4 months ago
1991
IEEE
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
83
Voted
CORR
2007
Springer
15 years 17 days ago
2007
Springer
— We study the high-power asymptotic behavior of the sum-rate capacity of multi-user interference networks with an equal number of transmitters and receivers. We assume that each...