Sciweavers

21 search results - page 3 / 5
» Algorithmic Analysis of Piecewise FIFO Systems
Sort
View
ICALP
2003
Springer
13 years 11 months ago
Quantitative Analysis of Probabilistic Lossy Channel Systems
Many protocols are designed to operate correctly even in the case where the underlying communication medium is faulty. To capture the behaviour of such protocols, lossy channel sy...
Alexander Moshe Rabinovich
ESA
2005
Springer
113views Algorithms» more  ESA 2005»
13 years 11 months ago
Online Occlusion Culling
Abstract. Modern computer graphics systems are able to render sophisticated 3D scenes consisting of millions of polygons. For most camera positions only a small collection of these...
Gereon Frahling, Jens Krokowski
RTSS
2006
IEEE
14 years 9 days ago
Distributed Real-Time Detection and Tracking of Homogeneous Regions in Sensor Networks
In many applications we can deploy large number of sensors spanning wide geographical areas, to monitor environmental phenomena. The analysis of the data collected by such sensor ...
Sharmila Subramaniam, Vana Kalogeraki, Themis Palp...
ICCAD
2008
IEEE
150views Hardware» more  ICCAD 2008»
14 years 3 months ago
Performance estimation and slack matching for pipelined asynchronous architectures with choice
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...
Gennette Gill, Vishal Gupta, Montek Singh
HIPC
2007
Springer
13 years 10 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri