457 search results - page 16 / 92 » Upper and Lower Bounds on Continuous-Time Computation |
136
click to vote
VMV
2008
15 years 7 months ago
2008
We propose an adaptive decomposition algorithm to compute separation distances between arbitrarily shaped objects. Using the Gilbert-JohnsonKeerthi algorithm (GJK), we search for ...
158
click to vote
DCC
2010
IEEE
16 years 27 days ago
2010
IEEE
Channel-optimized index assignment of source codewords is arguably the simplest way of improving transmission error resilience, while keeping the source and/or channel codes intac...
197
click to vote
TIT
2010
15 years 22 days ago
2010
Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities gene...
196
click to vote
COCO
1993
Springer
15 years 10 months ago
1993
Springer
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
126
click to vote
LATA
2009
Springer
16 years 24 days ago
2009
Springer
In this paper we investigate the computational complexity of knot theoretic problems and show upper and lower bounds for planarity problem of signed and unsigned knot diagrams repr...