Sciweavers

10054 search results - page 1762 / 2011
» On the Complexity of Function Learning
Sort
View
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 4 months ago
A stochastic analysis of greedy routing in a spatially-dependent sensor network
For a sensor network, as tractable spatially-dependent node deployment model is presented with the property that the density is inversely proportional to the sink distance. A stoc...
H. Paul Keeler
149
Voted
COMCOM
2008
91views more  COMCOM 2008»
15 years 4 months ago
A WEP post-processing algorithm for a Robust 802.11 WLAN implementation
Wired Equivalent Privacy (WEP) protocol used within the IEEE 802.11 standard has "major security flaws" thus wireless local area networks (WLANs) using the protocol are ...
Taskin Koçak, Mohit Jagetia
132
Voted
CORR
2010
Springer
134views Education» more  CORR 2010»
15 years 4 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli
CORR
2010
Springer
88views Education» more  CORR 2010»
15 years 4 months ago
On the Proximity Factors of Lattice Reduction-Aided Decoding
Lattice reduction-aided decoding enables significant complexity saving and near-optimum performance in multi-input multi-output (MIMO) communications. However, its remarkable perfo...
Cong Ling
CORR
2010
Springer
99views Education» more  CORR 2010»
15 years 4 months ago
On Equivalence Between Network Topologies
One major open problem in network coding is to characterize the capacity region of a general multi-source multi-demand network. There are some existing computational tools for boun...
Michelle Effros, Tracey Ho, Shirin Jalali
« Prev « First page 1762 / 2011 Last » Next »