Sciweavers

Share
TMC
2011
213views more  TMC 2011»
8 years 5 months ago
Expected Routing Overhead for Location Service in MANETs under Flat Geographic Routing
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...
R. J. La, Eunyoung Seo
TIT
2011
113views more  TIT 2011»
8 years 5 months ago
Eigen-Inference for Energy Estimation of Multiple Sources
—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 ...
Romain Couillet, Jack W. Silverstein, Zhidong Bai,...
RSA
2011
85views more  RSA 2011»
8 years 5 months ago
Piercing random boxes
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...
Linh V. Tran
CORR
2010
Springer
94views Education» more  CORR 2010»
8 years 5 months ago
Partitions and Coverings of Trees by Bounded-Degree Subtrees
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...
David R. Wood
CORR
2011
Springer
181views Education» more  CORR 2011»
8 years 5 months ago
On Isolating Points Using Disks
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 ...
Matt Gibson, Gaurav Kanade, Kasturi R. Varadarajan
SIAMDM
2010
133views more  SIAMDM 2010»
8 years 8 months ago
Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4
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-...
Jean-Claude Bermond, Charles J. Colbourn, Lucia Gi...
INFOCOM
2010
IEEE
8 years 8 months ago
Analyzing Nonblocking Switching Networks using Linear Programming (Duality)
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...
Hung Q. Ngo, Atri Rudra, Anh N. Le, Thanh-Nhan Ngu...
DCG
2010
101views more  DCG 2010»
8 years 8 months ago
Unknot Diagrams Requiring a Quadratic Number of Reidemeister Moves to Untangle
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 ...
Joel Hass, Tahl Nowik
SIAMCOMP
1998
92views more  SIAMCOMP 1998»
8 years 10 months ago
Surface Approximation and Geometric Partitions
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...
Pankaj K. Agarwal, Subhash Suri
JCSS
2002
95views more  JCSS 2002»
8 years 10 months ago
Efficient algorithms for multichromosomal genome rearrangements
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...
Glenn Tesler
books