Sciweavers

114 search results - page 22 / 23
» pr 2008
Sort
View
SODA
2008
ACM
96views Algorithms» more  SODA 2008»
13 years 6 months ago
Greedy drawings of triangulations
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
Raghavan Dhandapani
GLOBECOM
2008
IEEE
13 years 6 months ago
Probabilistic Path Selection in Opportunistic Cognitive Radio Networks
Abstract—We present a novel routing approach for multichannel cognitive radio networks (CRNs). Our approach is based on probabilistically estimating the available capacity of eve...
Hicham Khalife, Satyajeet Ahuja, Naceur Malouch, M...
CORR
2008
Springer
102views Education» more  CORR 2008»
13 years 5 months ago
Finding cores of random 2-SAT formulae via Poisson cloning
For the random 2-SAT formula F(n, p), let FC(n, p) be the formula left after the pure literal algorithm applied to F(n, p) stops. Using the recently developed Poisson cloning model...
Jeong Han Kim
WICON
2008
13 years 6 months ago
SAMPL: a simple aggregation and message passing layer for sensor networks
In recent years, wireless sensor networking has shown great promise in applications ranging from industrial control, environmental monitoring and inventory tracking. Given the res...
Anthony Rowe, Karthik Lakshmanan, Ragunathan Rajku...
BMCBI
2008
126views more  BMCBI 2008»
13 years 5 months ago
Relating gene expression data on two-component systems to functional annotations in Escherichia coli
Background: Obtaining physiological insights from microarray experiments requires computational techniques that relate gene expression data to functional information. Traditionall...
Anne M. Denton, Jianfei Wu, Megan K. Townsend, Pre...