IPL
2006
13 years 5 months ago
2006
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
IPL
2006
13 years 5 months ago
2006
In this paper, we propose a new proof method for strong normalization of calculi with control operators, and, by this method, we prove strong normalization of the system
IPL
2006
13 years 5 months ago
2006
We present a matrix multiplication based algorithm for counting the number of (induced) occurrences of a fixed r-uniform hypergraph in a larger hypergraph. In many cases, the runn...
IPL
2006
13 years 5 months ago
2006
We show how randomized caches can be used in resource-poor partial-state routers to provide a fair share of bandwidth to short-lived flows that are known as mice when long-lived f...
IPL
2006
13 years 5 months ago
2006
IPL
2006
13 years 5 months ago
2006
A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...
IPL
2006
13 years 5 months ago
2006
We consider the online scheduling problem with m - 1, m 2, uniform machines each with a processing speed of 1, and one machine with a speed of s, 1 s 2, to minimize the makespa...
IPL
2006
13 years 5 months ago
2006
We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 - ). This improves the previously best approximation ratio of...
IPL
2006
13 years 5 months ago
2006
We study the NP-hard problem of labeling points with maximum-radius circle pairs: given n point sites in the plane, find a placement for 2n interior-disjoint uniform circles, such...
IPL
2006
13 years 5 months ago
2006
We obtain bounds for the coloring numbers of products of trees for three closely related types of colorings: acyclic, distance 2, and L(2, 1).