Sciweavers

342 search results - page 50 / 69
» queue 2008
Sort
View
DEBS
2008
ACM
13 years 11 months ago
Top-k/w publish/subscribe: finding k most relevant publications in sliding time window w
Existing content-based publish/subscribe systems are designed assuming that all matching publications are equally relevant to a subscription. As we cannot know in advance the dist...
Kresimir Pripuzic, Ivana Podnar Zarko, Karl Aberer
SIGMETRICS
2008
ACM
101views Hardware» more  SIGMETRICS 2008»
13 years 9 months ago
How to parameterize models with bursty workloads
Although recent advances in theory indicate that burstiness in the service time process can be handled effectively by queueing models (e.g., MAP queueing networks [2]), there is a...
Giuliano Casale, Ningfang Mi, Ludmila Cherkasova, ...
TC
2008
13 years 9 months ago
Reducing the Energy Consumption of Ethernet with Adaptive Link Rate (ALR)
The rapidly increasing energy consumption by computing and communications equipment is a significant economic and environmental problem that needs to be addressed. Ethernet network...
Chamara Gunaratne, Kenneth J. Christensen, Bruce N...
WCE
2007
13 years 10 months ago
Dynamic Scheduling Algorithm for input-queued crossbar switches
— Crossbars are main components of communication switches used to construct interconnection networks. Scheduling algorithm controls contention in switch architecture. Several sch...
Mihir V. Shah, Mehul C. Patel, Dinesh J. Sharma, A...
CVIU
2008
180views more  CVIU 2008»
13 years 9 months ago
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
Yun Zeng, Dimitris Samaras, Wei Chen, Qunsheng Pen...