Sciweavers

562 search results - page 48 / 113
» Dependency Pairs Revisited
Sort
View
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
15 years 6 months ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis
CORR
2007
Springer
114views Education» more  CORR 2007»
15 years 1 months ago
On the Throughput of Secure Hybrid-ARQ Protocols for Gaussian Block-Fading Channels
—The focus of this paper is an information-theoretic study of retransmission protocols for reliable packet communication under a secrecy constraint. The hybrid automatic retransm...
Xiaojun Tang, Ruoheng Liu, Predrag Spasojevic, H. ...
123
Voted
PIMRC
2008
IEEE
15 years 8 months ago
The limits of theory: Pragmatic challenges in mobile ad hoc systems
—The development of mobile ad hoc systems have considerably emphasized the need for a better understanding of the factors that influence the systems’ performance, i.e., mobili...
Franck Legendre, Martin May, Vincent Lenders, Gunn...
ISAAC
2004
Springer
114views Algorithms» more  ISAAC 2004»
15 years 7 months ago
Structural Alignment of Two RNA Sequences with Lagrangian Relaxation
RNA is generally a single-stranded molecule where the bases form hydrogen bonds within the same molecule leading to structure formation. In comparing different homologous RNA mole...
Markus Bauer, Gunnar W. Klau
133
Voted
ISCC
2003
IEEE
15 years 7 months ago
Throughput Achievable with No Relaying in a Mobile Interference Network
— We consider a network of n sender/receiver pairs, placed randomly in a region of unit area. Network capacity, or maximum throughput, is defined as the highest rate that can be...
Elif Uysal-Biyikoglu, Abtin Keshavarzian