Sciweavers

9949 search results - page 11 / 1990
» On the Network Complexity of Selection
Sort
View
ISNN
2004
Springer
14 years 26 days ago
Sparse Bayesian Learning Based on an Efficient Subset Selection
Based on rank-1 update, Sparse Bayesian Learning Algorithm (SBLA) is proposed. SBLA has the advantages of low complexity and high sparseness, being very suitable for large scale pr...
Liefeng Bo, Ling Wang, Licheng Jiao
QSHINE
2005
IEEE
14 years 1 months ago
Solving The Multi-Constrained Path Selection Problem By Using Depth First Search
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
Zhenjiang Li, J. J. Garcia-Luna-Aceves
P2P
2005
IEEE
189views Communications» more  P2P 2005»
14 years 1 months ago
Proximity Neighbor Selection for a DHT in Wireless Multi-Hop Networks
A mobile ad hoc network (MANET) is a multi-hop wireless network having no infrastructure. Thus, the mobile nodes have to perform basic control tasks, such as routing, and higher-l...
Curt Cramer, Thomas Fuhrmann
EMNETS
2007
13 years 11 months ago
An HMM framework for optimal sensor selection with applications to BSN sensor glove design
Laparoscopic surgical training is a challenging task due to the complexity of instrument control and demand on manual dexterity and hand-eye coordination. Currently, training and ...
Rachel C. King, Louis Atallah, Ara Darzi, Guang-Zh...
MOBIHOC
2002
ACM
14 years 7 months ago
Path set selection in mobile ad hoc networks
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
Emin Gün Sirer, Panagiotis Papadimitratos, Zy...