Sciweavers

575 search results - page 78 / 115
» A Note on Karr's Algorithm
Sort
View
TCOM
2010
106views more  TCOM 2010»
14 years 9 months ago
Achievable information rates for channels with insertions, deletions, and intersymbol interference with i.i.d. inputs
—We propose to use various trellis structures to characterize different types of insertion and deletion channels. We start with binary independent and identically distributed (i....
Jun Hu, Tolga M. Duman, M. Fatih Erden, Aleksandar...
GLOBECOM
2010
IEEE
14 years 9 months ago
Finding and Mending Barrier Gaps in Wireless Sensor Networks
Constructing sensing barriers using wireless sensor networks has important applications in military operations and homeland security. The goal of forming a sensing barrier is to de...
Anwar Saipulla, Benyuan Liu, Jie Wang
ECCC
2011
234views ECommerce» more  ECCC 2011»
14 years 6 months ago
On the complexity of computational problems regarding distributions (a survey)
We consider two basic computational problems regarding discrete probability distributions: (1) approximating the statistical difference (aka variation distance) between two given d...
Oded Goldreich, Salil P. Vadhan
ICALP
2001
Springer
15 years 3 months ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
INFOCOM
2008
IEEE
15 years 5 months ago
Fast and Distributed Computation of Schedules in Wireless Networks
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
Supratim Deb, Karan Mangla, K. V. M. Naidu