804 search results - page 103 / 161 » On the Termination of the Chase Algorithm |
92
Voted
PIMRC
2010
IEEE
14 years 10 months ago
2010
IEEE
A two-way relay channel with independent parallel Gaussian channels between the relay and the two terminals is considered. Focusing on the decode-and-forward protocol, the second p...
107
Voted
COMGEO
2011
ACM
14 years 7 months ago
2011
ACM
A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum ...
86
Voted
ESA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...
134
click to vote
ECRTS
2007
IEEE
15 years 7 months ago
2007
IEEE
Feedback control techniques have recently been applied to a variety of real-time systems. However, a fundamental issue that was left out is guaranteeing system controllability and...
111
click to vote
ICCTA
2007
IEEE
15 years 6 months ago
2007
IEEE
We study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem work under the assumption that bef...