TMC
2011
13 years 6 months ago
2011
Abstract—We study routing overhead due to location information collection and retrieval in mobile ad-hoc networks employing geographic routing with no hierarchy. We first provid...
TIT
2011
13 years 6 months ago
2011
—This paper introduces a new method to blindly estimate the transmit power of multiple signal sources in multiantenna fading channels, when the number of sensing devices and the ...
RSA
2011
13 years 6 months ago
2011
Abstract. Consider a set of n random axis parallel boxes in the unit hypercube in Rd , where d is fixed and n tends to infinity. We show that the minimum number of points one nee...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
This paper addresses the following questions for a given tree T and integer d 2: (1) What is the minimum number of degree-d subtrees that partition E(T)? (2) What is the minimum n...
CORR
2011
Springer
13 years 6 months ago
2011
Springer
In this paper, we consider the problem of choosing disks (that we can think of as corresponding to wireless sensors) so that given a set of input points in the plane, there exists ...
SIAMDM
2010
13 years 9 months ago
2010
We study grooming for two-period optical networks, a variation of the traffic grooming problem for WDM ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-...
INFOCOM
2010
IEEE
13 years 10 months ago
2010
IEEE
Abstract—The main task in analyzing a switching network design (including circuit-, multirate-, and photonic-switching) is to determine the minimum number of some switching compo...
DCG
2010
13 years 10 months ago
2010
Given any knot diagram E, we present a sequence of knot diagrams of the same knot type, for which the minimum number of Reidemeister moves required to pass to E is quadratic with ...
SIAMCOMP
1998
13 years 11 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
JCSS
2002
13 years 11 months ago
2002
Hannenhalli and Pevzner [5] gave a polynomial time algorithm for computing the minimum number of reversals, translocations, fissions, and fusions, that would transform one multichr...