Sciweavers

95 search results - page 7 / 19
» Filling and slotting: analysis and algorithms
Sort
View
ACTA
2006
70views more  ACTA 2006»
13 years 7 months ago
Throughput analysis in wireless networks with multiple users and multiple channels
Abstract We consider the problem of maximizing throughput in a multi-carrier wireless network that employs predictive link adaptation. We explicitly consider the time-penalty incur...
Amrinder Arora, Fanchun Jin, Gokhan Sahin, Hosam M...
DEXAW
2008
IEEE
129views Database» more  DEXAW 2008»
14 years 2 months ago
SODA: An Algorithm to Guarantee Correctness of Concurrent Transaction Execution in Mobile P2P Databases
This paper proposes an optimistic concurrency control (CC) algorithm, called Sequential Order with Dynamic Adjustment (SODA), that guarantees timely and correct execution of concu...
Zhaowen Xing, Le Gruenwald, K. K. Phang
CORR
2010
Springer
99views Education» more  CORR 2010»
13 years 7 months ago
A New Phase Transition for Local Delays in MANETs
: We study a slotted version of the Aloha Medium Access (MAC) protocol in a Mobile Ad-hoc Network (MANET). Our model features transmitters randomly located in the Euclidean plane, ...
François Baccelli, Bartek Blaszczyszyn
ISBI
2002
IEEE
14 years 8 months ago
Parcellation of brain images with anatomical and functional constraints for fMRI data analysis
In this paper we propose a methodology for brain parcellation with anatomical and functional constraints dedicated to fMRI data analysis. The aim is to provide a representation of...
Denis Rivière, Ferath Kherif, Guillaume Fla...
STOC
2007
ACM
94views Algorithms» more  STOC 2007»
14 years 7 months ago
Constructing non-computable Julia sets
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
Mark Braverman, Michael Yampolsky