Sciweavers

3008 search results - page 472 / 602
» Independence in connected graphs
Sort
View
SOCO
2007
Springer
16 years 1 months ago
Dynamically Adaptable Applications with iPOJO Service Components
Traditional component models and frameworks simplified software system development by enabling developers to break software systems into independent pieces with well-defined interf...
Clément Escoffier, Richard S. Hall
FOCS
2006
IEEE
16 years 1 months ago
Dispersion of Mass and the Complexity of Randomized Geometric Algorithms
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
Luis Rademacher, Santosh Vempala
207
Voted
INFOCOM
2006
IEEE
16 years 1 months ago
The Case for Non-Cooperative Multihoming of Users to Access Points in IEEE 802.11 WLANs
— In many cases, a mobile user has the option of connecting to one of several IEEE 802.11 access points (APs), each using an independent channel. User throughput in each AP is de...
Srinivas Shakkottai, Eitan Altman, Anurag Kumar
IPPS
2006
IEEE
16 years 1 months ago
A virtual network (ViNe) architecture for grid computing
This paper describes a virtual networking approach for Grids called ViNe. It enables symmetric connectivity among Grid resources and allows existing applications to run unmodified...
Maurício O. Tsugawa, José A. B. Fort...
IWCMC
2006
ACM
16 years 1 months ago
VANETCODE: network coding to enhance cooperative downloading in vehicular ad-hoc networks
Inter-vehicular communication is fast emerging as a popular application for mobile ad-hoc networks. Content distribution in Vehicular Ad-Hoc Networks (VANET) is particularly chall...
Shabbir Ahmed, Salil S. Kanhere