Sciweavers

1259 search results - page 29 / 252
» On Survivable Access Network Design: Complexity and Algorith...
Sort
View
142
Voted
MOBICOM
2009
ACM
15 years 10 months ago
Achievable throughput of multiple access spectrum systems based on cognitive relay
Cognitive relays form a special cooperation relationship among users in cognitive radio networks, and help increase the transmission rates of both primary users and secondary user...
Wei Wang, Baochun Li, Li Yu
AINA
2009
IEEE
15 years 11 months ago
Medium Access Control in Large Scale Clusters for Wireless Sensor Networks
—One of the main advantages of clustering algorithms is the ability to allow networks to be physically divided into smaller regions, thereby increasing the theoretical maximum nu...
Pedro N. E. S. Barbosa, Neil M. White, Nick R. Har...
ICANN
2010
Springer
15 years 4 months ago
Tumble Tree - Reducing Complexity of the Growing Cells Approach
We propose a data structure that decreases complexity of unsupervised competitive learning algorithms which are based on the growing cells structures approach. The idea is based on...
Hendrik Annuth, Christian-A. Bohn
DSD
2010
IEEE
161views Hardware» more  DSD 2010»
15 years 4 months ago
Design of Trace-Based Split Array Caches for Embedded Applications
—Since many embedded systems execute a predefined set of programs, tuning system components to application programs and data is the approach chosen by many design techniques to o...
Alice M. Tokarnia, Marina Tachibana
FSTTCS
2009
Springer
15 years 10 months ago
Iterative Methods in Combinatorial Optimization
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
R. Ravi