Sciweavers

7006 search results - page 452 / 1402
» Approximation Algorithms
Sort
View
INFOCOM
2008
IEEE
15 years 11 months ago
Fast and Distributed Computation of Schedules in Wireless Networks
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
Supratim Deb, Karan Mangla, K. V. M. Naidu
137
Voted
GLOBECOM
2006
IEEE
15 years 11 months ago
Throughput Guarantees for Wireless Networks with Opportunistic Scheduling
In this letter we develop an expression for the approximate throughput guarantee violation probability (TGVP) for users in time-slotted networks for any scheduling algorithm with ...
Vegard Hassel, Geir E. Øien, David Gesbert
ICPR
2008
IEEE
16 years 6 months ago
A discrete-time parallel update algorithm for distributed learning
We present a distributed machine learning framework based on support vector machines that allows classification problems to be solved iteratively through parallel update algorithm...
Christian Bauckhage, Tansu Alpcan
146
Voted
CAV
2007
Springer
122views Hardware» more  CAV 2007»
15 years 9 months ago
Parameterized Verification of Infinite-State Processes with Global Conditions
We present a simple and effective approximated backward reachability algorithm for parameterized systems with existentially and universally quantified global conditions. The indivi...
Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezin...
PDPTA
2007
15 years 6 months ago
Brokering Algorithms for Composing Low Cost Distributed Storage Resources
Abstract In this paper we investigate the composition of cheap network storage resources to meet specific availability and capacity requirements. We show that the problem of find...
Jimmy Secretan, Malachi Lawson, Ladislau Böl&...