IPL
2006
13 years 5 months ago
2006
In the past 5 years, a series of verification algorithms has been proposed for infinite Markov chains that have a finite attractor, i.e., a set that will be visited infinitely oft...
IPL
2006
13 years 5 months ago
2006
Let TS be the set of all crossing-free straight line spanning trees of a planar n-point set S. Consider the graph TS where two members T and T of TS are adjacent if T intersects T...
IPL
2006
13 years 5 months ago
2006
At the heart of the Goldreich-Levin Theorem is the problem of determining an n-bit string a by making queries to two oracles, referred to as IP (inner product) and EQ (equivalence...
IPL
2006
13 years 5 months ago
2006
Guillotine partitions play an important role in many research areas and application domains, e.g., computational geometry, computer graphics, integrated circuit layout, and solid ...