Sciweavers

1224 search results - page 180 / 245
» Design and Implementation of a Practical Parallel Delaunay A...
Sort
View
INFOCOM
2007
IEEE
15 years 10 months ago
Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
Abdul Kader Kabbani, Theodoros Salonidis, Edward W...
ICDCS
2009
IEEE
16 years 1 months ago
Pushing the Envelope: Extreme Network Coding on the GPU
While it is well known that network coding achieves optimal flow rates in multicast sessions, its potential for practical use has remained to be a question, due to its high compu...
Hassan Shojania, Baochun Li
CVPR
2009
IEEE
16 years 11 months ago
A Convex Relaxation Approach for Computing Minimal Partitions
In this work we propose a convex relaxation approach for computing minimal partitions. Our approach is based on rewriting the minimal partition problem (also known as Potts mode...
Thomas Pock (Graz University of Technology), Anton...
INFOCOM
1997
IEEE
15 years 8 months ago
Atomic Resource Sharing in Noncooperative Networks
In noncooperative networks, resources are shared among selfish users, which optimize their individual performance measure. We consider the generic and practically important case o...
Lavy Libman, Ariel Orda
WOB
2004
120views Bioinformatics» more  WOB 2004»
15 years 5 months ago
Reconfigurable Systems for Sequence Alignment and for General Dynamic Programming
ABSTRACT. Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and r...
Ricardo P. Jacobi, Mauricio Ayala-Rincón, L...