Given two distributions over an n element set, we wish to check whether these distributions are statistically close by only sampling. We give a sublinear algorithm which uses O(n2/3ǫ−4 logn) independent samples from each distribution, runs in time linear in the sample size, makes no assumptions about the structure of the distributions, and distinguishes the cases when the distance between the d...

We have shown, how a schedulability analysis, including a codesign approach for periodic tasks, can be extended for the analysis of sporadic tasks and dependencies between tasks, what often occurs in SDL/MSC specified systems. To allow this we extended the classical task model with starting points for each task. To calculate the response times of sporadic tasks we consider instances of tasks. T...

Let P be a simple polygon of n vertices and let S be a set of n points called sites lying in the interior of P. The geodesic-distance between two sites x and y in P is defined as the length of the shortest polygonal path connecting x and y constrained to lie in P. It is a useful notion in graphics problems concerning visibility between objects, computer vision problems concerned with the descri...

It is known that if a 2-universal hash function H is applied to elements of a block source (X1, . . . , XT ), where each item Xi has enough min-entropy conditioned on the previous items, then the output distribution (H,H(X1), . . . , H(XT )) will be “close” to the uniform distribution. We provide improved bounds on how much min-entropy per item is required for this to hold, both when we ask tha...

This paper presents a new hardware-software co-design methodology for resource constrained SoC realized in a deep submicron process (DSM). The methodology is useful for multimedia applications optimized for latency. The approach addresses layout and hardware aspects relevant to system design: it considers the dependency of task communication speed on interconnect parasitic, as well as the possi...

were made for get_file operations on a disk to memory basis, i.e. the files were requested from the file servers disk and discarded on the receivers side. Thus we where able to neglect the influence of local disk write operations upon the results. This resembles a scenario where a user requests a certain file (e.g. a drawing) for viewing. Since drawings are typically stored as bitmaps (binary) ...