350 search results - page 57 / 70 » Lower and upper bounds on obtaining history independence |
131
click to vote
GRAPHICSINTERFACE
2007
15 years 1 months ago
2007
Modeling 3D objects and scenes is an important part of computer graphics. One approach to modeling is projecting binary patterns onto the scene in order to obtain correspondences ...
101
click to vote
JEC
2006
14 years 11 months ago
2006
The paper addresses a novel method for realtime analysis of systems with cyclic data flows. The presented method is based on Network Calculus principles, where upper and lower flo...
SIAMDM
2008
14 years 11 months ago
2008
For a real c 1 and an integer n, let f(n, c) denote the maximum integer f such that every graph on n vertices contains an induced subgraph on at least f vertices in which the max...
COMBINATORICS
2004
14 years 11 months ago
2004
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive...
110
click to vote
TELSYS
2002
2002
Performance Analysis of Reassembly and Multiplexing Queueing with Long-Range-Dependent Input Traffic
14 years 11 months ago
This paper studies the impact of long-range-dependent (LRD) traffic on the performance of reassembly and multiplexing queueing. A queueing model characterizing the general reassemb...