Sciweavers

658 search results - page 112 / 132
» Lower bounds for sorting networks
Sort
View
NCA
2009
IEEE
14 years 2 months ago
Analysis of Round-Robin Implementations of Processor Sharing, Including Overhead
—It has been observed in recent years that in many applications service time demands are highly variable. Without foreknowledge of exact service times of individual jobs, process...
Steve Thompson, Lester Lipsky, Sarah Tasneem, Feng...
ICDCSW
2008
IEEE
14 years 2 months ago
Towards Cyber-Physical Holodeck Systems Via Physically Rendered Environments (PRE's)
We present an early vision of a cyber-physical environment in which computer controlled rendering of physical surfaces, terrains, and environments is achieved by manipulating grid...
Veljko Krunic, Richard Han
INFOCOM
2008
IEEE
14 years 2 months ago
A New ACK Policy To Mitigate the Effects of Coexisting IEEE 802.11/802.11e Devices
— In IEEE 802.11 wireless networks, EDCA users’ performance may be degraded because of the existence of legacy users and therefore would get a lower priority service. Such effe...
Haithem Al-Mefleh, J. Morris Chang
INFOCOM
2005
IEEE
14 years 1 months ago
FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs
Abstract— The distributed hash table (DHT) scheme has become the core component of many large-scale peer-to-peer networks. Degree, diameter, and congestion are important measures...
Dongsheng Li, Xicheng Lu, Jie Wu
WEA
2010
Springer
316views Algorithms» more  WEA 2010»
14 years 23 days ago
Modularity-Driven Clustering of Dynamic Graphs
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
Robert Görke, Pascal Maillard, Christian Stau...